Linear time algorithm to check the singularity of block graphs

DOI10.1007/978-3-030-11509-8_7MaRDI QIDQ2326567zbMATH OpenOpenAlexFDO

Authors Ranveer Singh, Naomi Shaked-Monderer, A. Berman

Publication date 10 October 2019

Full work available at URL https://arxiv.org/abs/1808.03411

zbMATH Keywords

blockblock graphnonsingular graphnullity

Mathematics Subject Classification ID

Trees (05C05) Determinants, permanents, traces, other special matrix functions (15A15) Algorithms in computer science (68Wxx)

Recommendations

• Nonsingular (vertex-weighted) block graphs
• Characterizations of non-singular cycles and trees
• A characterization of singular graphs
• scientific article; zbMATH DE number 6438262
• On the adjacency matrix of a block graph

Cited in

(4)

• A linear time algorithm for the nullity of vertex-weighted block graphs
• Nonsingular (vertex-weighted) block graphs
• On \((k+1)\)-line graphs of \(k\)-trees and their nullities
• On the adjacency matrix of a block graph

This page was built for publication: Linear time algorithm to check the singularity of block graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2326567)