Skip to main content

Linear Time Algorithm to Check the Singularity of Block Graphs

Part of the Lecture Notes in Computer Science book series (LNTCS,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

This work is supported by the Joint NSFC-ISF Research Program (jointly funded by the National Natural Science Foundation of China and the Israel Science Foundation (Nos. 11561141001, 2219/15).

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-030-11509-8_7
  • Chapter length: 14 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   54.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-11509-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   69.99
Price excludes VAT (USA)
Fig. 1.
Fig. 2.
Fig. 3.

References

  1. Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms. Pearson Education India, New Delhi (1974)

    MATH  Google Scholar 

  2. Bapat, R.B.: Graphs and Matrices. Springer, London (2014). https://doi.org/10.1007/978-1-4471-6569-9

    CrossRef  MATH  Google Scholar 

  3. Bapat, R.: A note on singular line graphs. Bull. Kerala Math. Assoc. 8(2), 207–209 (2011)

    MathSciNet  Google Scholar 

  4. Bapat, R., Roy, S.: On the adjacency matrix of a block graph. Linear Multilinear Algebra 62(3), 406–418 (2014)

    CrossRef  MathSciNet  Google Scholar 

  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)

    CrossRef  MathSciNet  Google Scholar 

  6. Cvetkovic, D.M., Doob, M., Sachs, H.: Spectra of Graphs. Pure Applied Mathematics, vol. 87. Academic Press, New York (1980)

    MATH  Google Scholar 

  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)

    CrossRef  MathSciNet  Google Scholar 

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

    CrossRef  MathSciNet  Google Scholar 

  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. Gutman, I., Sciriha, I.: On the nullity of line graphs of trees. Discret. Math. 232(1–3), 35–45 (2001)

    CrossRef  MathSciNet  Google Scholar 

  11. Hopcroft, J.E., Tarjan, R.E.: Efficient algorithms for graph manipulation (1971)

    Google Scholar 

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

    CrossRef  MathSciNet  Google Scholar 

  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. Lee, S.L., Li, C.: Chemical signed graph theory. Int. J. Quantum Chem. 49(5), 639–648 (1994)

    CrossRef  Google Scholar 

  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. Nath, M., Sarma, B.K.: On the null-spaces of acyclic and unicyclic singular graphs. Linear Algebra Appl. 427(1), 42–54 (2007)

    CrossRef  MathSciNet  Google Scholar 

  17. Singh, R., Bapat, R.B.: B-partitions, application to determinant and permanent of graphs. Trans. Comb. 7(3), 29–47 (2018)

    MathSciNet  Google Scholar 

  18. Singh, R., Bapat, R.: On characteristic and permanent polynomials of a matrix. Spec. Matrices 5, 97–112 (2017)

    CrossRef  MathSciNet  Google Scholar 

  19. Singh, R., Zheng, C., Shaked-Monderer, N., Berman, A.: Nonsingular block graphs: an open problem. arXiv preprint arXiv:1803.03947 (2018)

  20. Von Collatz, L., Sinogowitz, U.: Spektren endlicher grafen. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 21, 63–77 (1957)

    CrossRef  MathSciNet  Google Scholar 

  21. West, D.B.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)

    Google Scholar 

  22. Williams, V.V.: Breaking the Coppersmith-Winograd barrier (2011)

    Google Scholar 

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

    CrossRef  MathSciNet  Google Scholar 

Download references

Acknowledgments

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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ranveer Singh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Singh, R., Shaked-Monderer, N., Berman, A. (2019). Linear Time Algorithm to Check the Singularity of Block Graphs. In: Pal, S., Vijayakumar, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2019. Lecture Notes in Computer Science(), vol 11394. Springer, Cham. https://doi.org/10.1007/978-3-030-11509-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-11509-8_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-11508-1

  • Online ISBN: 978-3-030-11509-8

  • eBook Packages: Computer ScienceComputer Science (R0)