Abstract
For an n-vertex graph G, a fractional matching of G is a function f giving each edge a real number in [0, 1] such that \(\sum _{e\in \Gamma (v)}f(e)\le 1\) for each vertex \(v\in V(G)\), where \(\Gamma (v)\) is the set of edges incident to v. A fractional perfect matching is a fractional matching f with \(\sum _{e\in E(G)}f(e)=\frac{n}{2}\). In this paper, we establish tight lower bounds on the size and the spectral radius of G to guarantee that G has a fractional perfect matching, respectively. In addition, we investigate the relationship between fractional perfect matching and \(\mathcal {P}_{\geqslant 2}\)-factor, and give some sufficient conditions for a graph to have a \(\mathcal {P}_{\geqslant 2}\)-factor.
Similar content being viewed by others
References
Akiyama, J., Avis, D., Era, H.: On a \(\{1,2\}\)-factor of a graph. TRU Math. 16, 97–102 (1980)
Brouwer, A.E., Haemers, W.H.: Spectra of Graphs—Monograph. Springer, Berlin (2011)
Brouwer, A.E., Haemers, W.H.: Eigenvalues and perfect matchings. Linear Algebra Appl. 395, 155–162 (2005)
Behrend, R.E., Suil, O., West, D.B.: Sharp lower bounds on the fractional matching number. Discrete Appl. Math. 186, 272–274 (2015)
Cioabǎ, S.M.: Perfect matchings, eigenvalues and expansion. C. R. Math. Acad. Sci. Soc. R. Can. 27, 101–104 (2005)
Cioabǎ, S.M., Gregory, D.A.: Large matchings from eigenvalues. Linear Algebra Appl. 422, 308–317 (2007)
Cioabǎ, S.M., Gregory, D.A., Haemers, W.H.: Matchings in regular graphs from eigenvalues. J. Combin. Theory Ser. B 99, 287–297 (2009)
Choi, I., Kim, J., Suil, O.: The difference and ratio of the fractional matching number and the matching number of graphs. Discrete Math. 339, 1382–1386 (2016)
Feng, L., Yu, G., Zhang, X.: Spectral radius of graphs with given matching number. Linear Algebra Appl. 422, 133–138 (2007)
Fan, D., Goryainov, S., Huang, X., Lin, H.: The spanning k-trees, perfect matchings and spectral radius of graphs. Linear Multilinear Algebra 70, 7264–7275 (2022)
Gu, X., Liu, M.: A tight lower bound on the matching number of graphs via Laplacian eigenvalues. Eur. J Combin. 101, 103468 (2022)
Hou, Y., Li, J.: Bounds on the largest eigenvalues of trees with a given size of matching. Linear Algebra Appl. 342, 203–212 (2002)
Li, S., Miao, S.: Characterizing \(\cal{P} _{\geqslant 2}\)-factor and \(\cal{P} _{\geqslant 2}\)-factor covered graphs with respect to the size or the spectral radius. Discrete Math. 344, 112588 (2021)
Liu, R., Lai, H., Guo, L., Xue, J.: Fractional matching number and spectral radius of nonnegative matrices of graphs. Linear Multilinear Algebra 70, 4133–4145 (2022)
Suil, O.: Spectral radius and fractional matchings in graphs. Eur. J Combin. 55, 144–148 (2016)
Suil, O.: Spectral radius and matchings in graphs. Linear Algebra Appl. 614, 316–324 (2021)
Pan, Y., Li, J., Zhao, W.: Signless Laplacian spectral radius and fractional matchings in graphs. Discrete Math. 343, 112016 (2020)
Scheinerman, E.R., Ullman, D.H.: Fractional Graph Theory: A Rational Approach to the Theory of Graphs. Wiley, New York (1997)
Xue, J., Zhai, M., Shu, J.: Fractional matching number and eigenvalues of a graph. Linear Multilinear Algebra 67, 2565–2574 (2019)
You, L., Yang, M., So, W., Xi, W.: On the spectrum of an equitable matrix and its application. Linear Algebra Appl. 577, 21–40 (2019)
Zhang, W.: The maximum spectral radius of t-connected graphs with bounded matching number. Discrete Math. 345, 112775 (2022)
Zhang, Y., Lin, H.: Perfect matching and distance spectral radius in graphs and bipartite graphs. Discrete Appl. Math. 304, 315–322 (2021)
Zhao, Y., Huang, X., Wang, Z.: The \(A_{\alpha }\)-spectral radius and perfect matchings in graphs. Linear Algebra Appl. 631, 143–155 (2021)
Acknowledgements
The authors would like to express their sincere gratitude to all the referees for their careful reading and insightful suggestions.
Funding
The autthors have not disclosed any funding.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
There is no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Pan, Y., Liu, C. Spectral Radius and Fractional Perfect Matchings in Graphs. Graphs and Combinatorics 39, 52 (2023). https://doi.org/10.1007/s00373-023-02652-w
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-023-02652-w