Hostname: page-component-77c89778f8-n9wrp Total loading time: 0 Render date: 2024-07-19T23:44:57.486Z Has data issue: false hasContentIssue false

ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS

Published online by Cambridge University Press:  13 January 2023

SHUCHAO LI
Affiliation:
Faculty of Mathematics and Statistics, Central China Normal University, Wuhan 430079, PR China e-mail: lscmath@ccnu.edu.cn
SHUJING MIAO
Affiliation:
Faculty of Mathematics and Statistics, Central China Normal University, Wuhan 430079, PR China e-mail: sjmiao2020@sina.com
MINJIE ZHANG*
Affiliation:
School of Mathematics and Statistics, Hubei University of Arts and Science, Xiangyang 441053, PR China

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.

Type
Research Article
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of Australian Mathematical Publishing Association Inc.

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

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

Bapat, R. B., Graphs and Matrices, 2nd edn (Hindustan Book Agency, New Delhi, 2018).Google Scholar
Brouwer, A. E. and Haemers, W. H., ‘Eigenvalues and perfect matchings’, Linear Algebra Appl. 395 (2005), 155162.10.1016/j.laa.2004.08.014CrossRefGoogle Scholar
Brouwer, A. E. and Haemers, W. H., Spectra of Graphs (Springer, New York, 2011).Google Scholar
Godsil, C. and Royle, G., Algebraic Graph Theory, Graduate Texts in Mathematics, 207 (Springer, New York, 2001).10.1007/978-1-4613-0163-9CrossRefGoogle Scholar
Horn, R. A. and Johnson, C. R., Matrix Analysis (Cambridge University Press, Cambridge, 1985).10.1017/CBO9780511810817CrossRefGoogle Scholar
Ilić, A., ‘Distance spectral radius of trees with given matching number’, Discrete Appl. Math. 158 (2010), 17991806.10.1016/j.dam.2010.06.018CrossRefGoogle Scholar
Liu, Z. Z., ‘On the spectral radius of the distance matrix’, Appl. Anal. Discrete Math. 4 (2010), 269277.10.2298/AADM100428020LCrossRefGoogle Scholar
Lu, H. Y. and Luo, J., ‘Extremal unicyclic graphs with minimal distance spectral radius’, Discuss. Math. Graph Theory 34 (2014), 735749.10.7151/dmgt.1772CrossRefGoogle Scholar
Minc, H., Nonnegative Matrices (Wiley, New York, 1988).Google Scholar
O, S., ‘Spectral radius and fractional matchings in graphs’, European J. Combin. 55 (2016), 144148.10.1016/j.ejc.2016.02.004CrossRefGoogle Scholar
O, S., ‘Spectral radius and matchings in graphs’, Linear Algebra Appl. 614 (2021), 316324.10.1016/j.laa.2020.06.004CrossRefGoogle Scholar
Scheinermann, E. R. and Ullman, D. H., Fractional Graph Theory: A Rational Approach to the Theory of Graphs (Wiley, New York, 1997).Google Scholar
West, D. B., Introduction to Graph Theory (Prentice Hall, Inc., Upper Saddle River, NJ, 2001).Google Scholar
You, L. H., Yang, M., So, W. and Xi, W. G., ‘On the spectrum of an equitable quotient matrix and its application’, Linear Algebra Appl. 577 (2019), 2140.10.1016/j.laa.2019.04.013CrossRefGoogle Scholar
Zhang, X. L., ‘On the distance spectral radius of unicyclic graphs with perfect matching’, Electron. J. Linear Algebra 27 (2014), 569587.10.13001/1081-3810.1919CrossRefGoogle Scholar