Abstract
To discuss the matching uniqueness of the simple undirected graph G. To find the necessary and sufficient conditions for the matching uniqueness of T(a,b,c). Use the maximum real roots, and the properties of matching polynomials to compute. For n ≥ 5, T(1,5,n) and its complement are matching uniqueness if and only if n ≠ 5,8 and 15.
Keywords
Supported by the Scientific Research Foundation of the Education Department of Guangxi Province of China (201010LX471;201010LX495;201106LX595; 201106LX608); the Natural Science Fund of Hechi University (2011YBZ-N003).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall, New York (1993)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam (1976)
Ma, H.: Graphs Characterized by the Roots of Matching. Journal of Qufu Normal University (Natural Science) 27(1), 33–36 (2001)
Ma, H.: The Graphs G with \(2<M(G)\leq{\sqrt{2+\sqrt5}}\). Acta Scientiarum Naturalium Universitatis Neimongol 36(5), 485–487 (2005)
Sheng, S.: The Matching Uniqueness of T −shape Trees. Journal of Mathematical Study 32(1), 86–91 (1999)
Cvetkovic, D., Rowlinson, P.: The largest eigenvalue of a graph: A survey. Linear and Multilinear Algebra 28(1,2), 3–33 (1990)
Cvetkovic, D.M., Doob, M., Gutman, I., Torgaser, A.: Recent result in the theory of graph spectra. Elsevier Science Publishers, New York (1988)
Ma, H., Zhao, H.: The Matching Unique Graphs with Large Degree or Small Degree. Journal of Mathematical Research and Exposition 24(2), 369–373 (2004)
Ma, H., Ren, H.: The new methods for constructing matching-equivalence Graphs. Discrete Mathematics 307, 125–131 (2007)
Qiao, Y., Zhan, F.: Matching Uniqueness of T(1,4,n) and its Complement. Natural Science Journal of Hainan University 26(3), 220–224 (2008)
Zhan, F., Qiao, Y., Zhao, L.: The Matching Uniqueness of a Class of New Graphs. Journal of Southwest China Normal University (Natural Science Edition) 35(3), 7–11 (2010)
Shen, S.: On matching characterization of a Caterpillars. Pure and Applied Mathematics 26(4), 541–545 (2010)
Shen, S.: On Matching Characterization of K 1 ∪ T(1,3,n) and Its Complement. Journal of Southwest China Normal University (Natural Science Edition) 34(3), 5–9 (2009)
Zhang, G., Li, Y.: A Lower Bound for the Second Largest Eigenvalue of a Class of Tree Matching. Journal of North University of China (Natural Science Edition) 32(1), 1–3 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qiao, Y., Zhan, F. (2011). Application of the Maximum Real Roots of Matching Polynomial. In: Liu, B., Chai, C. (eds) Information Computing and Applications. ICICA 2011. Lecture Notes in Computer Science, vol 7030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25255-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-25255-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25254-9
Online ISBN: 978-3-642-25255-6
eBook Packages: Computer ScienceComputer Science (R0)