Skip to main content
SpringerLink
Log in

Application of the Maximum Real Roots of Matching Polynomial

  • Conference paper
Information Computing and Applications (ICICA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7030))

Included in the following conference series:

  • 2453 Accesses

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.

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 to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall, New York (1993)

    MATH  Google Scholar 

  2. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam (1976)

    Book  MATH  Google Scholar 

  3. Ma, H.: Graphs Characterized by the Roots of Matching. Journal of Qufu Normal University (Natural Science) 27(1), 33–36 (2001)

    MathSciNet  MATH  Google Scholar 

  4. Ma, H.: The Graphs G with \(2<M(G)\leq{\sqrt{2+\sqrt5}}\). Acta Scientiarum Naturalium Universitatis Neimongol 36(5), 485–487 (2005)

    Google Scholar 

  5. Sheng, S.: The Matching Uniqueness of T −shape Trees. Journal of Mathematical Study 32(1), 86–91 (1999)

    MathSciNet  Google Scholar 

  6. Cvetkovic, D., Rowlinson, P.: The largest eigenvalue of a graph: A survey. Linear and Multilinear Algebra 28(1,2), 3–33 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cvetkovic, D.M., Doob, M., Gutman, I., Torgaser, A.: Recent result in the theory of graph spectra. Elsevier Science Publishers, New York (1988)

    Google Scholar 

  8. 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)

    MathSciNet  MATH  Google Scholar 

  9. Ma, H., Ren, H.: The new methods for constructing matching-equivalence Graphs. Discrete Mathematics 307, 125–131 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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)

    MathSciNet  Google Scholar 

  11. 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)

    Google Scholar 

  12. Shen, S.: On matching characterization of a Caterpillars. Pure and Applied Mathematics 26(4), 541–545 (2010)

    MathSciNet  MATH  Google Scholar 

  13. 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)

    MathSciNet  Google Scholar 

  14. 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)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Hechi University, Yizhou, Guangxi, 546300, China

    Youfu Qiao & Fuqin Zhan

Authors
  1. Youfu Qiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fuqin Zhan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Science, Hebei United University, Xinhua West Road 46, 063000, Tangshan, Hebei, China

    Baoxiang Liu

  2. School of Computer Science and Information Engineering, Zhejiang Gongshang University, Xueheng Street 18, 310018, Hangzhou, China

    Chunlai Chai

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation