A note proving the nullity of block graphs is unbounded
From MaRDI portal
(Redirected from Publication:6646411)
Recommendations
Cites work
- scientific article; zbMATH DE number 1472133 (Why is no real title available?)
- A linear time algorithm for connected \(p\)-centdian problem on block graphs
- A linear time algorithm for metric dimension of cactus block graphs
- Block-graph width
- Characterizing and recognizing probe block graphs
- Coalesced and embedded nut graphs in singular graphs
- Core-periphery models via integer programming: maximizing the influence of the core
- Maximal and extremal singular graphs
- Maximal core size in singular graphs
- Nonsingular (vertex-weighted) block graphs
- Nullity of graphs: an updated survey
- On nut and core singular fullerenes
- On the adjacency matrix of a block graph
- On the characterization of graphs with pendent vertices and given nullity
- On the construction of graphs of nullity one
- On the null-spaces of acyclic and unicyclic singular graphs
- On the nullity of a graph with cut-points
- On the nullity of bicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of graphs
- On the nullity of graphs with pendant trees
- On the nullity of graphs with pendent vertices
- On the nullity of line graphs of trees
- On the nullity of unicyclic graphs
- Optimal radio labellings of block graphs and line graphs of trees
- Power domination in block graphs
- The connected p-center problem on block graphs with forbidden vertices
- The maximum order of adjacency matrices of graphs with a given rank
- Trees with maximum nullity
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)
