On edge singularity and eigenvectors of mixed graphs
From MaRDI portal
Publication:928245
DOI10.1007/s10114-007-1000-2zbMath1143.05058OpenAlexW1966532289MaRDI QIDQ928245
Publication date: 11 June 2008
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-007-1000-2
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (11)
On the spectrum of 3-coloured digraphs ⋮ The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number ⋮ Bipartiteness and the least eigenvalue of signless Laplacian of graphs ⋮ Super \(d\)-antimagic labelings of disconnected plane graphs ⋮ The \(A_\alpha\)-spread of a graph ⋮ On the distribution of Laplacian eigenvalues of a graph ⋮ Balancedness and the least eigenvalue of Laplacian of signed graphs ⋮ On weighted directed graphs ⋮ Labelings of plane graphs containing Hamilton path ⋮ Strong labelings of linear forests ⋮ Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Laplacian spectrum of a mixed graph
- Laplacian matrices of graphs: A survey
- Algebraic graph theory without orientation
- On spectral integral variations of mixed graphs
- Upper bound for the Laplacian graph eigenvalues
- The Laplacian eigenvalues of mixed graphs
- Non-bipartite graphs with third largest Laplacian eigenvalue less than three
- Bounds for the least Laplacian eigenvalue of a signed graph
- Generalized matrix tree theorem for mixed graphs
- Perron components and algebraic connectivity for weighted graphs
- Edge version of the matrix tree theorem for trees
- On the least eigenvalue of a unicyclic mixed graph
- Algebraic connectivity and the characteristic set of a graph
- A relation between the matching number and Laplacian spectrum of a graph
This page was built for publication: On edge singularity and eigenvectors of mixed graphs