On connected graphs of order n with girth g and nullity n-g

DOI10.1016/J.LAA.2021.07.005MaRDI QIDQ820992zbMATH OpenOpenAlexFDO

Authors Qi Zhou, Dein Wong, 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

zbMATH Keywords

rankgirthshortest cyclenullity of a graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40) Structural characterization of families of graphs (05C75) Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• Graphs \(G\) with nullity \(n(G) - g(G) -1\)
• On the maximal nullity of unicyclic graphs with fixed girth
• Graphs with nullity \(2c(G)+p(G)-1\)
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• Characterizing Graphs with Nullity n-4

Cites work

• 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 \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• A characterization of graphs with rank 4
• 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 upper bound of the nullity of a graph in terms of order and maximum degree
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• Nullities of graphs with given order, matching number and cyclomatic number revisited
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
• On the nullity of graphs
• 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
• The extremal graphs with respect to their nullity
• 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
• Trees with maximum nullity

Cited in

(12)

• The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph
• Graphs \(G\) with nullity \(n(G) - g(G) -1\)
• The gap between the rank of a complex unit gain graph and its underlying graph
• A bound on the rank of weighted graphs in terms of 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 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?)
• On connected \(\mathbb{T}\)-gain graphs with rank equal to girth
• On extremal graphs for zero forcing number
• Signed graphs G^ with nullity n(G^) - g(G^) -1
• Characterizing the negative inertia index of connected graphs in terms of their girth

This page was built for publication: On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820992)