On the nullity of a connected graph in terms of order and maximum degree
From MaRDI portal
(Redirected from Publication:2244875)
Recommendations
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- On the nullity of graphs
- An upper bound of the nullity of a graph in terms of order and maximum degree
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 510845 (Why is no real title available?)
- scientific article; zbMATH DE number 540115 (Why is no real title available?)
- scientific article; zbMATH DE number 3414355 (Why is no real title available?)
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
- A short proof of Zhou, Wong and Sun's conjecture
- An introduction to the theory of graph spectra
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Eigenspaces of graphs
- Extremal values and bounds for the zero forcing number
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
- Logic circuits from zero forcing
- Nondiscriminatory propagation on trees
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- On the nullity and the matching number of unicyclic graphs
- On the nullity of graphs with pendant trees
- On the nullity of tricyclic graphs
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- Proof of a conjecture on the nullity of a graph
- Proof of a conjecture on the zero forcing number of a graph
- Some bounds on the zero forcing number of a graph
- Trees with maximum nullity
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing sets and the minimum rank of graphs
Cited in
(16)- The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph
- Proof of a conjecture on the nullity of a graph
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Maximum generic nullity of a graph
- A short proof of Zhou, Wong and Sun's conjecture
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
- The gap between the rank of a complex unit gain graph and its underlying graph
- On the nullity number of graphs
- On the trees with maximum nullity
- On connected signed graphs with rank equal to girth
- Characterization of graphs with rank 2v(G) - 2(G) - 2c(G) + 1
- scientific article; zbMATH DE number 7692350 (Why is no real title available?)
- Bounds for zero forcing numbers of connected graphs with fixed order and maximum degree
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- On the nullity of graphs
This page was built for publication: On the nullity of a connected graph in terms of order and maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2244875)