Independence and matching number of some graphs

Ming Chen (), Yusheng Li () and Yiting Yang ()
Additional contact information
Ming Chen: Jiaxing University
Yusheng Li: Tongji University
Yiting Yang: Tongji University

Journal of Combinatorial Optimization, 2019, vol. 37, issue 4, No 14, 1342-1350

Abstract: Abstract For a graph G, let n(G), $$\alpha (G)$$ α ( G ) and $$\beta (G)$$ β ( G ) be its order, independence number and matching number, respectively. We showed that $$\frac{\Delta (G)+k}{4}\alpha (G) + \beta (G) \ge n(G)$$ Δ ( G ) + k 4 α ( G ) + β ( G ) ≥ n ( G ) for some $$K_k$$ K k -free graph G with $$\Delta (G)\ge k-1\ge 2$$ Δ ( G ) ≥ k - 1 ≥ 2 .

Keywords: Independence number; Matching number; Maximum degree (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0356-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:37:y:2019:i:4:d:10.1007_s10878-018-0356-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0356-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().