On bounds of A_-eigenvalue multiplicity and the rank of a complex unit gain graph

DOI10.1016/J.DISC.2023.113503MaRDI QIDQ6098089zbMATH OpenOpenAlexFDO

Authors Aniruddha Samanta

Publication date 12 June 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2023.113503

zbMATH Keywords

adjacency matrixcomplex unit gain graphrank of a graph\(A_\alpha\)-matrix

Mathematics Subject Classification ID

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

Recommendations

• Bounds for the rank of a complex unit gain graph in terms of the independence number
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
• On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph

Cites work

• A Bound for the Chromatic Number of a Graph
• A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
• An upper bound for the nullity of a bipartite graph in terms of its maximum degree
• An upper bound of the nullity of a graph in terms of order and maximum degree
• Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
• Biased graphs. I: Bias, balance, and gains
• Bounds for the energy of a complex unit gain graph
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Chromatic number and the 2-rank of a graph
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• Extremal values and bounds for the zero forcing number
• Gain distance matrices for complex unit gain graphs
• Graph theory
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Inertia of complex unit gain graphs
• Line graphs of complex unit gain graphs with least eigenvalue \(-2\)
• Merging the \(A\)- and \(Q\)-spectral theories
• On rank vs. communication complexity
• On the adjacency matrix of a complex unit gain graph
• On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
• Open problems in the spectral theory of signed graphs
• Proof of a conjecture on the nullity of a graph
• Some bounds on the zero forcing number of a graph
• Spectral properties of complex unit gain graphs
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
• The rank and size of graphs
• The rank of a cograph
• The rank of a complex unit gain graph in terms of the matching number
• Trees with maximum nullity
• Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
• Zero forcing sets and the minimum rank of graphs

Cited in

(3)

• Unifying adjacency, Laplacian, and signless Laplacian theories
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree

This page was built for publication: On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph

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