Advertisement

Linear Time Algorithm to Check the Singularity of Block Graphs

  • Ranveer SinghEmail author
  • Naomi Shaked-Monderer
  • Avi Berman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11394)

Abstract

A block graph is a graph in which every block is a complete graph. Let G be a block graph and let A(G) be its (0, 1)-adjacency matrix. Graph G is called nonsingular (singular) if A(G) is nonsingular (singular). Characterizing nonsingular block graphs is an interesting open problem proposed by Bapat and Roy in 2013. In this article, we give a linear time algorithm to check whether a given block graph is singular or not.

Keywords

Block Block graph Nonsingular graph Nullity 

AMS Subject Classifications

15A15 05C05 

Notes

Acknowledgments

The authors are grateful to Dr. Cheng Zheng for his valuable comments and suggestions.

References

  1. 1.
    Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms. Pearson Education India, New Delhi (1974)zbMATHGoogle Scholar
  2. 2.
    Bapat, R.B.: Graphs and Matrices. Springer, London (2014).  https://doi.org/10.1007/978-1-4471-6569-9CrossRefzbMATHGoogle Scholar
  3. 3.
    Bapat, R.: A note on singular line graphs. Bull. Kerala Math. Assoc. 8(2), 207–209 (2011)MathSciNetGoogle Scholar
  4. 4.
    Bapat, R., Roy, S.: On the adjacency matrix of a block graph. Linear Multilinear Algebra 62(3), 406–418 (2014)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Berman, A., Friedland, S., Hogben, L., Rothblum, U.G., Shader, B.: An upper bound for the minimum rank of a graph. Linear Algebra Appl. 429(7), 1629–1638 (2008)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Cvetkovic, D.M., Doob, M., Sachs, H.: Spectra of Graphs. Pure Applied Mathematics, vol. 87. Academic Press, New York (1980)zbMATHGoogle Scholar
  7. 7.
    Davie, A.M., Stothers, A.J.: Improved bound for complexity of matrix multiplication. Pro. R. Soc. Edinb.: Sect. A Math. 143(02), 351–369 (2013)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Fiorini, S., Gutman, I., Sciriha, I.: Trees with maximum nullity. Linear Algebra Appl. 397, 245–251 (2005)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Gutman, I., Borovicanin, B.: Nullity of graphs: an updated survey. In: Selected Topics on Applications of Graph Spectra, pp. 137–154. Mathematical Institute SANU, Belgrade (2011)Google Scholar
  10. 10.
    Gutman, I., Sciriha, I.: On the nullity of line graphs of trees. Discret. Math. 232(1–3), 35–45 (2001)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Hopcroft, J.E., Tarjan, R.E.: Efficient algorithms for graph manipulation (1971)Google Scholar
  12. 12.
    Hu, S., Xuezhong, T., Liu, B.: On the nullity of bicyclic graphs. Linear Algebra Appl. 429(7), 1387–1391 (2008)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 296–303. ACM (2014)Google Scholar
  14. 14.
    Lee, S.L., Li, C.: Chemical signed graph theory. Int. J. Quantum Chem. 49(5), 639–648 (1994)CrossRefGoogle Scholar
  15. 15.
    Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 1361–1370. ACM (2010)Google Scholar
  16. 16.
    Nath, M., Sarma, B.K.: On the null-spaces of acyclic and unicyclic singular graphs. Linear Algebra Appl. 427(1), 42–54 (2007)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Singh, R., Bapat, R.B.: B-partitions, application to determinant and permanent of graphs. Trans. Comb. 7(3), 29–47 (2018)MathSciNetGoogle Scholar
  18. 18.
    Singh, R., Bapat, R.: On characteristic and permanent polynomials of a matrix. Spec. Matrices 5, 97–112 (2017)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Singh, R., Zheng, C., Shaked-Monderer, N., Berman, A.: Nonsingular block graphs: an open problem. arXiv preprint arXiv:1803.03947 (2018)
  20. 20.
    Von Collatz, L., Sinogowitz, U.: Spektren endlicher grafen. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 21, 63–77 (1957)MathSciNetCrossRefGoogle Scholar
  21. 21.
    West, D.B.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)Google Scholar
  22. 22.
    Williams, V.V.: Breaking the Coppersmith-Winograd barrier (2011)Google Scholar
  23. 23.
    Xuezhong, T., Liu, B.: On the nullity of unicyclic graphs. Linear Algebra Appl. 408, 212–220 (2005)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Ranveer Singh
    • 1
    Email author
  • Naomi Shaked-Monderer
    • 1
    • 2
  • Avi Berman
    • 1
  1. 1.Technion-Israel Institute of TechnologyHaifaIsrael
  2. 2.The Max Stern Yezreel Valley CollegeYezreel ValleyIsrael

Personalised recommendations