A linear time algorithm for the nullity of vertex-weighted block graphs

DOI10.1016/j.dam.2020.12.028zbMath1494.05107OpenAlexW3126940628WikidataQ113877253 ScholiaQ113877253MaRDI QIDQ2161234

Naomi Shaked-Monderer, Abraham Berman, Ranveer Singh

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.12.028

zbMATH Keywords

nullityblock graphvertex-weighted

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spektren endlicher Grafen
• On the nullity of bicyclic graphs
• An upper bound for the minimum rank of a graph
• On characteristic and permanent polynomials of a matrix
• Trees with maximum nullity
• Linear time algorithm to check the singularity of block graphs
• On the null-spaces of acyclic and unicyclic singular graphs
• Inverses of triangular matrices and bipartite graphs
• On the nullity of unicyclic graphs
• Improved bound for complexity of matrix multiplication
• Powers of tensors and fast matrix multiplication
• On the adjacency matrix of a block graph
• On the nullity of line graphs of trees

This page was built for publication: A linear time algorithm for the nullity of vertex-weighted block graphs