Bounds of nullity for complex unit gain graphs

DOI10.1016/J.LAA.2024.07.006MaRDI QIDQ6615437zbMATH OpenFDO

Authors Qian-Qian Chen, Jiming Guo

Publication date 8 October 2024

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

Full work available at URL https://doi.org/10.1016/J.LAA.2024.07.006

zbMATH Keywords

blockcomplex unit gain grapheigenvaluenullity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• The rank of a complex unit gain graph in terms of the matching number
• Complex unit gain graphs with exactly one positive eigenvalue
• Bounds for the rank of a complex unit gain graph in terms of the independence number
• Complex unit gain graphs of rank 2
• Inertia indices of a complex unit gain graph in terms of matching number

Cites work

• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• 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
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• Complex unit gain graphs of rank 2
• scientific article; zbMATH DE number 3414355 (Why is no real title available?)
• Inertia of complex unit gain graphs
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• Nonsingular (vertex-weighted) block graphs
• Nullities of graphs with given order, matching number and cyclomatic number revisited
• 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
• Nullity of graphs: an updated survey
• On the nullity and the matching number of unicyclic graphs
• On the nullity of a graph with cut-points
• On the nullity of bicyclic graphs
• On the nullity of bipartite graphs
• On the nullity of bipartite graphs
• On the nullity of tricyclic graphs
• On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• On the trees with maximum nullity
• Relation between the skew-rank of an oriented graph and the rank of its underlying graph
• Spectral properties of complex unit gain graphs
• Spektren endlicher Grafen
• The extremal graphs with respect to their nullity
• The nullity of a graph with fractional matching number
• 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
• The rank of a signed graph

Cited in

(1)

• Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number

This page was built for publication: Bounds of nullity for complex unit gain graphs

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