Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
From MaRDI portal
(Redirected from Publication:2295996)
Recommendations
- Balancedness and the least eigenvalue of Laplacian of signed graphs
- Bounds for the extremal eigenvalues of gain Laplacian matrices
- Line graphs of complex unit gain graphs with least eigenvalue -2
- Gain distance matrices for complex unit gain graphs
- The least Laplacian eigenvalue of the unbalanced unicyclic signed graphs with k pendant vertices
Cites work
- A mathematical bibliography of signed and gain graphs and allied areas
- Balancedness and the least eigenvalue of Laplacian of signed graphs
- Biased graphs. I: Bias, balance, and gains
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- On edge singularity and eigenvectors of mixed 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
- Properties of first eigenvectors and eigenvalues of nonsingular weighted directed graphs
- Spectral properties of complex unit gain graphs
Cited in
(17)- Bounds for the extremal eigenvalues of gain Laplacian matrices
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
- Complex unit gain graphs with exactly one positive eigenvalue
- Gain-line graphs via \(G\)-phases and group representations
- Spectra of quaternion unit gain graphs
- Criteria for balance in abelian gain graphs, with applications to piecewise-linear geometry
- Line graphs of complex unit gain graphs with least eigenvalue -2
- On eigenspaces of some compound complex unit gain graphs
- Principal Minors of Hermitian (Quasi-)Laplacian Matrix of Second Kind for Mixed Graphs
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
- Characterizing signed mixed graphs with small eigenvalues
- NEPS of complex unit gain graphs
- Eigenvalues of complex unit gain graphs and gain regularity
- On token signed graphs
- Matrix-tree theorems for complex unit gain networks
- Asymptotic normality for the coefficients of graph polynomials
This page was built for publication: Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2295996)