Saturation Numbers for Linear Forests ∗

Feifei Song, Yan Zou and Hengdi Su

Mathematical Problems in Engineering, 2021, vol. 2021, 1-7

Abstract:

For a given graph , graph is called - saturated if does not contain a copy of , but has a copy of , where . The saturation number, denoted by , is the minimum size of a graph with order in all - saturated graphs. For , this paper considers the saturation number of linear forests and describes the extremal graph.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/6613393.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/6613393.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:6613393

DOI: 10.1155/2021/6613393

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().