On the nullity of a connected graph in terms of order and maximum degree
DOI10.1016/J.LAA.2021.09.015zbMATH Open1478.05089OpenAlexW3199482904MaRDI QIDQ2244875FDOQ2244875
Muhuo Liu, Bit-Shun Tam, Bo Cheng
Publication date: 12 November 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.09.015
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
rankinduced subgraphnullity of a graphpendant \(K_2\) deletion0-basic subgraphdual vertexpendant-dual vertex
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Zero forcing sets and the minimum rank of graphs
- Eigenspaces of graphs
- An introduction to the theory of graph spectra
- Trees with maximum nullity
- A characterization of graphs with rank 5
- Title not available (Why is that?)
- A characterization of graphs with rank 4
- On the nullity of tricyclic graphs
- On the nullity and the matching number of unicyclic graphs
- Some bounds on the zero forcing number of a graph
- Proof of a conjecture on the zero forcing number of a graph
- Extremal values and bounds for the zero forcing number
- Nondiscriminatory propagation on trees
- Upper bounds on the \(k\)-forcing number of a graph
- On the nullity of graphs with pendant trees
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
- Title not available (Why is that?)
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- An upper bound of the nullity of a 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
- A short proof of Zhou, Wong and Sun's conjecture
- 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 graph
- Title not available (Why is that?)
- Logic circuits from zero forcing
Cited In (5)
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)