On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\)
From MaRDI portal
Publication:820992
DOI10.1016/J.LAA.2021.07.005zbMath1473.05196OpenAlexW3188648783MaRDI QIDQ820992
Dein Wong, Qi Zhou, Bit-Shun Tam
Publication date: 29 September 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.07.005
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Connectivity (05C40) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (8)
Graphs \(G\) with nullity \(n(G) - g(G) -1\) ⋮ On connected signed graphs with rank equal to girth ⋮ On graphs with girth \(g\) and positive inertia index of \(\frac{\lceil g\rceil}{2}-1\) and \(\frac{\lceil g\rceil}{2}\) ⋮ On connected \(\mathbb{T}\)-gain graphs with rank equal to girth ⋮ Unnamed Item ⋮ Characterizing the negative inertia index of connected graphs in terms of their girth ⋮ The gap between the rank of a complex unit gain graph and its underlying graph ⋮ On extremal graphs for zero forcing number
Cites Work
- Unnamed Item
- Unnamed Item
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- A characterization of graphs with rank 4
- On the nullity of tricyclic graphs
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Trees with maximum nullity
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
- A short proof of Zhou, Wong and Sun's conjecture
- No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- On the nullity of graphs
- The extremal graphs with respect to their nullity
- Proof of a conjecture on the nullity of a graph
This page was built for publication: On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\)