On connected T-gain graphs with rank equal to girth

DOI10.1016/J.LAA.2024.02.022MaRDI QIDQ6204179zbMATH OpenFDO

Authors Suliman Khan

Publication date 27 March 2024

Published in Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

rankgirthcyclomatic number\(\mathbb{T}\)-gain graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Distance in graphs (05C12) Paths and cycles (05C38)

Recommendations

• The gap between the rank of a complex unit gain graph and its underlying graph
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• Complex unit gain graphs of rank 2
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree

Cites work

• A note on the nullity of unicyclic signed graphs
• Biased graphs. I: Bias, balance, and gains
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
• Graphs \(G\) with nullity \(n(G) - g(G) -1\)
• Graphs with nullity \(2c(G)+p(G)-1\)
• Inertia of complex unit gain graphs
• No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
• Nullity and singularity of a graph in which every block is a cycle
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• On connected graphs of order n with girth g and nullity n-g
• On connected signed graphs with rank equal to girth
• On the determinant of the Laplacian matrix of a complex unit gain graph
• On the rank of weighted graphs
• Spectral properties of complex unit gain graphs
• Spektren endlicher Grafen
• The nullity of bicyclic signed graphs
• The rank of a complex unit gain graph in terms of the matching number
• The rank of a complex unit gain graph in terms of the rank of its underlying graph

Cited in

(3)

• The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph
• Relation between the H-rank of a mixed graph and the girth of its underlying graph
• A bound on the rank of weighted graphs in terms of girth

This page was built for publication: On connected \(\mathbb{T}\)-gain graphs with rank equal to girth

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