On the adjacency matrix of a complex unit gain graph
From MaRDI portal
Abstract: A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge. In this article, first we establish bounds for the eigenvalues of the complex unit gain graphs. Then we study some of the properties of the adjacency matrix of complex unit gain graph in connection with the characteristic and the permanental polynomials. Then we establish spectral properties of the adjacency matrices of complex unit gain graphs. In particular, using Perron-Frobenius theory, we establish a characterization for bipartite graphs in terms of the set of eigenvalues of gain graph and the set of eigenvalues of the underlying graph. Also, we derive an equivalent condition on the gain so that the eigenvalues of the gain graph and the eigenvalues of the underlying graph are the same.
Recommendations
Cites work
- A reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\)
- An introduction to the theory of graph spectra
- Balance in gain graphs - a spectral analysis
- Biased graphs IV: Geometrical realizations
- Biased graphs. I: Bias, balance, and gains
- Bounds for eigenvalues of a graph
- Bounds for eigenvalues using traces
- Characteristic polynomials of skew-adjacency matrices of oriented graphs
- Effect on normalized graph Laplacian spectrum by motif attachment and duplication
- Graphs and matrices
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Laplacian matrices of graphs: A survey
- Matrices in the theory of signed simple graphs
- On the determinant of the Laplacian matrix of a complex unit gain graph
- On weighted directed graphs
- Oriented gain graphs, line graphs and eigenvalues
- Permanental polynomials of graphs
- Signed graphs
- Signless Laplacians of finite graphs
- Skew-adjacency matrices of graphs
- Spectra of graphs
- Spectral properties of complex unit gain graphs
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- The Determinant of the Adjacency Matrix of a Graph
Cited in
(31)- Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
- On cospectrality of gain graphs
- Complex unit gain graphs of rank 2
- Complex unit gain graphs with exactly one positive eigenvalue
- Bounds for the energy of a complex unit gain graph
- Gain distance matrices for complex unit gain graphs
- Spectra of quaternion unit gain graphs
- On the determinant of the Laplacian matrix of a complex unit gain graph
- Spectral properties of complex unit gain graphs
- On eigenspaces of some compound complex unit gain graphs
- scientific article; zbMATH DE number 7666851 (Why is no real title available?)
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
- Balance theory: an extension to conjugate skew gain graphs
- Combinatorial necessary conditions for regular graphs to induce periodic quantum walks
- NEPS of complex unit gain graphs
- On symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphs
- Eigenvalues of complex unit gain graphs and gain regularity
- On the spectrum of complex unit gain graphs
- Optimal dual frame pairs: a synergy with graph theory
- Godsil-McKay switchings for gain graphs
- On the nullity of cycle-spliced \(\mathbb{T}\)-gain graphs
- The determinant of the adjacency matrix of a quaternion unit gain graph
- \(\mathfrak{C}\)-inverse of graphs and mixed graphs
- Symmetry in complex unit gain graphs and their spectra
- Bounds and extremal graphs for the energy of complex unit gain graphs
- Distance matrices for conjugate skew gain graphs
- Quantum-like states on complex synchronized networks
- Dual quaternion matrices in precise formation flying of satellite clusters
- On spectra of Hermitian Randić matrix of second kind
- On spectrally optimal duals for r-erasures of frames generated by graphs
- Bounds for the Laplacian energy of complex unit gain graphs
This page was built for publication: On the adjacency matrix 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 Q5080254)
