Abstract
The nullity of a vertex-weighted graph is equal to the number of zero eigenvalues of its adjacency matrix. In this article, we give a linear time algorithm to calculate the nullity of vertex-weighted block graphs, i.e., graphs in which every block is a clique, with weights assigned to the vertices.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
