Article contents
ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS
Published online by Cambridge University Press: 13 January 2023
Abstract
We first establish a lower bound on the size and spectral radius of a graph G to guarantee that G contains a fractional perfect matching. Then, we determine an upper bound on the distance spectral radius of a graph G to ensure that G has a fractional perfect matching. Furthermore, we construct some extremal graphs to show all the bounds are best possible.
MSC classification
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 108 , Issue 2 , October 2023 , pp. 187 - 199
- Copyright
- © The Author(s), 2023. Published by Cambridge University Press on behalf of Australian Mathematical Publishing Association Inc.
Footnotes
The first author acknowledges the financial support from the National Natural Science Foundation of China (Grant Nos. 12171190, 11671164) and the third author acknowledges the financial support from the National Natural Science Foundation of China (Grant No. 11901179).
References
- 4
- Cited by