A note proving the nullity of block graphs is unbounded
From MaRDI portal
Publication:6646411
DOI10.1016/J.DISC.2024.114289MaRDI QIDQ6646411
Publication date: 2 December 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial aspects of block designs (05B05) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trees with maximum nullity
- On the nullity of unicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- On the nullity of a graph with cut-points
- On the nullity of bicyclic graphs
- A linear time algorithm for metric dimension of cactus block graphs
- On the nullity of graphs with pendant trees
- On the nullity of graphs with pendent vertices
- The connected \(p\)-center problem on block graphs with forbidden vertices
- Nullity of graphs: an updated survey
- On the construction of graphs of nullity one
- Maximal core size in singular graphs
- On the null-spaces of acyclic and unicyclic singular graphs
- On nut and core singular fullerenes
- On the nullity of graphs
- Power domination in block graphs
- Maximal and extremal singular graphs
- Block-graph width
- The maximum order of adjacency matrices of graphs with a given rank
- Characterizing and recognizing probe block graphs
- On the adjacency matrix of a block graph
- Optimal radio labellings of block graphs and line graphs of trees
- Coalesced and embedded nut graphs in singular graphs
- Nonsingular (vertex-weighted) block graphs
- A linear time algorithm for connected \(p\)-centdian problem on block graphs
- Core-periphery models via integer programming: maximizing the influence of the core
This page was built for publication: A note proving the nullity of block graphs is unbounded
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646411)
