Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

On the Nullity Algorithm of Tree and Unicyclic Graph

  • Conference paper
Information Computing and Applications (ICICA 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 106))

Included in the following conference series:

  • 1514 Accesses

Abstract

Let G be a graph with n vertices and q(G) be the maximum matching number of G. Let η(G) denote the nullity of G (the multiplicity of the eigenvalue zero of G). It is shown that the nullity algorithm of tree and unicyclic graph. At the same time, to prove two algorithms are efficient.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Ashraf, F., Bamdad, H.: A note on graphs with zero nullity. Match Commun. Math. Comput. Chem. 60, 15–19 (2008)

    MathSciNet  MATH  Google Scholar 

  2. Collatz, L., Sinogowitz, U.: Spektren edlicher Grafen. Abh. Math. Sem. Univ., Hamburg 21, 63–77 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cheng, B., Liu, B.: On the nullity of graphs. Electron. J. Linear Algebra 16, 60–67 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Longute-Higgins, H.C.: Resonance structures and MO in unsaturated hydrocarbons. Journal of Chemistry and Physics 18, 265–274 (1950)

    Article  Google Scholar 

  5. Cvetkovic, D., Doob, M., Sachs, H.: Spectra of Graphs. Academic Press, New York (1980)

    MATH  Google Scholar 

  6. Cvetković, D.M., Gutman, I.: The algbraic multiplicity of the number zero in the spacetrum of a bipartite graph. Mat Vesnik (9), 141–150 (1972)

    MathSciNet  MATH  Google Scholar 

  7. Hu, S., Tan, X., Liu, B.: On the nullity of bicyclic graphs. Linear Algebra Appl. 429(7), 1387–1391 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Wu, T.Z., Hu, S.: On the nullity of some classes graphs. Journal of Southwest University 32(4), 97–100 (2010)

    Google Scholar 

  9. Guo, J.M., Yan, W., Yeh, Y.N.: On the nullity and the matching number of unicyclic graphs. Linear Algebra and Application 431, 1293–1301 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. West, D.B.: Introduction to Graph Theory, 2nd edn. China Machine Press (October 2004)

    Google Scholar 

  11. Tan, X.Z., Liu, B.L.: On the nullity of unicyclic. Linear Algbebra and its Application 408, 212–220 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, T., Ma, D. (2010). On the Nullity Algorithm of Tree and Unicyclic Graph. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds) Information Computing and Applications. ICICA 2010. Communications in Computer and Information Science, vol 106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16339-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16339-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16338-8

  • Online ISBN: 978-3-642-16339-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics