Saturation Numbers for Linear Forests 2P4∪tP2∗

For a given graph F, graph G is called F-saturated if G does not contain a copy of F, but G+e has a copy of F, where e∉EG. The saturation number, denoted by satn,F, is the minimum size of a graph with order n in all F-saturated graphs. For n≥6t+22, this paper considers the saturation number of linea...

Full description

Bibliographic Details
Main Authors:	Feifei Song, Yan Zou, Hengdi Su
Format:	Article
Language:	English
Published:	Hindawi Limited 2021-01-01
Series:	Mathematical Problems in Engineering
Online Access:	http://dx.doi.org/10.1155/2021/6613393

id	doaj-c8a0390b8cce46c5a9f645c06c70c3e2
record_format	Article
spelling	doaj-c8a0390b8cce46c5a9f645c06c70c3e22021-05-17T00:01:19ZengHindawi LimitedMathematical Problems in Engineering1563-51472021-01-01202110.1155/2021/6613393Saturation Numbers for Linear Forests 2P4∪tP2∗Feifei Song0Yan Zou1Hengdi Su2Department of Information & Computational ScienceDepartment of Management EngineeringDepartment of Information & Computational ScienceFor a given graph F, graph G is called F-saturated if G does not contain a copy of F, but G+e has a copy of F, where e∉EG. The saturation number, denoted by satn,F, is the minimum size of a graph with order n in all F-saturated graphs. For n≥6t+22, this paper considers the saturation number of linear forests 2P4∪tP2 and describes the extremal graph.http://dx.doi.org/10.1155/2021/6613393
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Feifei Song Yan Zou Hengdi Su
spellingShingle	Feifei Song Yan Zou Hengdi Su Saturation Numbers for Linear Forests 2P4∪tP2∗ Mathematical Problems in Engineering
author_facet	Feifei Song Yan Zou Hengdi Su
author_sort	Feifei Song
title	Saturation Numbers for Linear Forests 2P4∪tP2∗
title_short	Saturation Numbers for Linear Forests 2P4∪tP2∗
title_full	Saturation Numbers for Linear Forests 2P4∪tP2∗
title_fullStr	Saturation Numbers for Linear Forests 2P4∪tP2∗
title_full_unstemmed	Saturation Numbers for Linear Forests 2P4∪tP2∗
title_sort	saturation numbers for linear forests 2p4∪tp2∗
publisher	Hindawi Limited
series	Mathematical Problems in Engineering
issn	1563-5147
publishDate	2021-01-01
description	For a given graph F, graph G is called F-saturated if G does not contain a copy of F, but G+e has a copy of F, where e∉EG. The saturation number, denoted by satn,F, is the minimum size of a graph with order n in all F-saturated graphs. For n≥6t+22, this paper considers the saturation number of linear forests 2P4∪tP2 and describes the extremal graph.
url	http://dx.doi.org/10.1155/2021/6613393
work_keys_str_mv	AT feifeisong saturationnumbersforlinearforests2p4tp2 AT yanzou saturationnumbersforlinearforests2p4tp2 AT hengdisu saturationnumbersforlinearforests2p4tp2
_version_	1721438822205489152

Saturation Numbers for Linear Forests 2P4∪tP2∗

Similar Items