Skip to main content

Extremal Singular Graphs

  • Chapter
  • First Online:
Discrete Mathematics and Applications

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 165))

  • 1178 Accesses

Abstract

A graph is called singular if its adjacency matrix is singular. The problem of characterizing all singular graphs was posed in 1957 by L. Collatz and U. Sinogowitz. Since then, it has been studied intensely due to its great importance in mathematics and in chemistry. However, the problem has proved to be rather complicated and has not yet been solved completely. In this paper, we emphasize on some of the most important results on graphs that are extremal with regard to their nullity/rank.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. G.J. Chang, L.H. Huang, H.G. Yeh, A characterization of graphs with rank 4. Linear Algebra Appl. 434(8), 1793–1798 (2011)

    Article  MathSciNet  Google Scholar 

  2. G.J. Chang, L.H. Huang, H.G. Yeh, A characterization of graphs with rank 5. Linear Algebra Appl. 436(11), 4241–4250 (2012)

    Article  MathSciNet  Google Scholar 

  3. B. Cheng, B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16(1), 5 (2007)

    Google Scholar 

  4. B. Cheng, B. Liu, On the nullity of tricyclic graphs. Linear Algebra Appl. 434(8), 1799–1810 (2011)

    Article  MathSciNet  Google Scholar 

  5. L. Collatz, U. Sinogowitz, Spektren endlicher grafen, in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 21, No. 1 (Springer, Berlin, 1957), pp. 63–77

    MATH  Google Scholar 

  6. D.M. Cvetković, I.M. Gutman, The algebraic multiplicity of the number zero in the spectrum of a bipartite graph. Matematic̆ki vesnik 9(56), 141–150 (1972)

    Google Scholar 

  7. D.M. Cvetkovic, M. Doob, H. Sachs, Spectra of Graphs, vol. 10 (Academic, New York, 1980)

    MATH  Google Scholar 

  8. Y.Z. Fan, K.S. Qian, On the nullity of bipartite graphs. Linear Algebra Appl. 430(11–12), 2943–2949 (2009)

    Article  MathSciNet  Google Scholar 

  9. S. Fiorini, I. Gutman, I. Sciriha, Trees with maximum nullity. Linear Algebra Appl. 397, 245–251 (2005)

    Article  MathSciNet  Google Scholar 

  10. C.D. Godsil, G.F. Royle, Chromatic number and the 2-rank of a graph. J. Combin. Theory Ser. B 81(1), 142–149 (2001)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. I. Gutman, B. Borovicanin, Nullity of graphs: an updated survey, in Selected Topics on Applications of Graph Spectra (Mathematical Institute, Belgrade, 2011), pp. 137–154

    Google Scholar 

  13. I. Gutman, I. Sciriha, On the nullity of line graphs of trees. Discrete Math. 232(1–3), 35–45 (2001)

    Article  MathSciNet  Google Scholar 

  14. I. Gutman, N. Trinajstić, Graph theory and molecular orbitals. Total -electron energy of alternant hydrocarbons. Chem. Phys. Lett. 17(4), 535–538 (1972)

    Google Scholar 

  15. S. Hu, T. Xuezhong, B. Liu, On the nullity of bicyclic graphs. Linear Algebra Appl. 429(7), 1387–1391 (2008)

    Article  MathSciNet  Google Scholar 

  16. S. Li, On the nullity of graphs with pendent vertices. Linear Algebra Appl. 429(7), 1619–1628 (2008)

    Article  MathSciNet  Google Scholar 

  17. W. Li, A. Chang, On the trees with maximum nullity. MATCH Commun. Math. Comput. Chem. 56(3), 501–508 (2006)

    MathSciNet  MATH  Google Scholar 

  18. J. Li, A. Chang, W.C. Shiu, On the nullity of bicyclic graphs. MATCH Commun. Math. Comput. Chem. 60(1), 21–36 (2008)

    MathSciNet  MATH  Google Scholar 

  19. H. Li, L. Su, H.X. Sun, On bipartite graphs which attain minimum rank among bipartite graphs with given diameter. Electron. J. Linear Algebra 23(1), 9 (2012)

    Google Scholar 

  20. H.C. Longuet-Higgins, Resonance structures and molecular orbitals in unsaturated hydrocarbons. J. Chem. Phys. 18, 265–274 (1950)

    Article  Google Scholar 

  21. X. Ma, D. Wong, F. Tian, Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices. Discrete Appl. Math. 215, 171–176 (2016)

    Article  MathSciNet  Google Scholar 

  22. C. Nuffelen, A bound for the chromatic number of a graph. Am. Math. Mon. 83(4), 265–266 (1976)

    Article  MathSciNet  Google Scholar 

  23. G.R. Omidi, On the nullity of bipartite graphs. Graphs Combin. 25(1), 111–114 (2009)

    Article  MathSciNet  Google Scholar 

  24. S. Rula, A. Chang, Y. Zheng, The extremal graphs with respect to their nullity. J. Inequal. Appl. 2016(1), 71 (2016)

    Google Scholar 

  25. I. Sciriha, On the construction of graphs of nullity one. Discrete Math. 181, 193–211 (1998)

    Article  MathSciNet  Google Scholar 

  26. I. Sciriha, On the rank of graphs, in Combinatorics, Graph Theory, and Algorithms, vol. II, ed. by Y. Alavi, D.R. Lick, A. Schwenk (New Issue Press, Western Michigan University, Kalamazoo, 1999), pp. 769–778

    Google Scholar 

  27. I. Sciriha, A characterization of singular graphs. Electron. J. Linear Algebra 16, 451–462 (2007)

    Article  MathSciNet  Google Scholar 

  28. Y. Song, X. Song, B. Tam, A characterization of graphs G with nullity ∣V (G)∣ − 2m(G) − c(G). Linear Algebra Appl. 465, 363–375 (2015)

    Article  MathSciNet  Google Scholar 

  29. Y.Z. Song, X.Q. Song, M. Zhang, An upper bound for the nullity of a bipartite graph in terms of its maximum degree. Linear Multilinear Algebra 64(6), 1107–1112 (2016)

    Article  MathSciNet  Google Scholar 

  30. L. Wang, D. Wong, Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank. Discrete Appl. Math. 166, 276–281 (2014)

    Article  MathSciNet  Google Scholar 

  31. H. Whitney, On the classification of graphs. Am. J. Math. 55, 236–244 (1933)

    Article  MathSciNet  Google Scholar 

  32. R. Wilson, Singular graphs, in Recent Studies in Graph Theory, ed. by V.R. Kulli (Vishwa International Publications, Gulbarga, 1989), pp. 228–236

    Google Scholar 

  33. T. Xuezhong, B. Liu, On the nullity of unicyclic graphs. Linear Algebra Appl. 408, 212–220 (2005)

    Article  MathSciNet  Google Scholar 

  34. Q. Zhou, D. Wong, D. Sun, An upper bound of the nullity of a graph in terms of order and maximum degree. Linear Algebra Appl. 555, 314–320 (2018)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Triantafillou, I. (2020). Extremal Singular Graphs. In: Raigorodskii, A.M., Rassias, M.T. (eds) Discrete Mathematics and Applications. Springer Optimization and Its Applications, vol 165. Springer, Cham. https://doi.org/10.1007/978-3-030-55857-4_20

Download citation

Publish with us

Policies and ethics