Nullity and singularity of a graph in which every block is a cycle
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3414355 (Why is no real title available?)
- Nonsingular (vertex-weighted) block graphs
- Nullity of graphs: an updated survey
- 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 line graphs of trees
- On the nullity of the line graph of unicyclic graph with depth one
- On the nullity of tricyclic graphs
- On the nullity of unicyclic graphs
- On the trees with maximum nullity
- Spektren endlicher Grafen
- Trees with maximum nullity
Cited in
(7)- The nullities of signed cycle-spliced graphs
- Singularity of cycle-spliced signed graphs
- Bounds of nullity for complex unit gain graphs
- Nullities of cycle-spliced bipartite graphs
- The zero forcing number of expanded paths and cycles
- On connected \(\mathbb{T}\)-gain graphs with rank equal to girth
- On the nullity of cycle-spliced \(\mathbb{T}\)-gain graphs
This page was built for publication: Nullity and singularity of a graph in which every block is a cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124640)