On spectral integral variations of mixed graphs
From MaRDI portal
Publication:1414166
DOI10.1016/S0024-3795(03)00575-5zbMath1026.05076MaRDI QIDQ1414166
Publication date: 19 November 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (16)
On the spectrum of 3-coloured digraphs ⋮ Nonsingular mixed graphs with few eigenvalues greater than two ⋮ On the spectrum of some signed complete and complete bipartite graphs ⋮ Spectral integral variation and unicyclic 3-colored digraphs with second smallest eigenvalue 1 ⋮ On weight-symmetric 3-coloured digraphs ⋮ Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order ⋮ On weighted directed graphs ⋮ On edge singularity and eigenvectors of mixed graphs ⋮ Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs ⋮ Largest eigenvalue of a unicyclic mixed graphs ⋮ Two spectral characterizations of regular, bipartite graphs with five eigenvalues ⋮ On the least eigenvalue of a unicyclic mixed graph ⋮ On eigenvectors of mixed graphs with exactly one nonsingular cycle ⋮ First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph ⋮ Unnamed Item ⋮ First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Laplacian spectrum of a mixed graph
- Lower bounds for the first eigenvalue of certain M-matrices associated with graphs
- Laplacian matrices of graphs: A survey
- Degree maximal graphs are Laplacian integral
- Algebraic graph theory without orientation
- The Laplacian Spectrum of a Graph
- Matrix Analysis
- Generalized matrix tree theorem for mixed graphs
- Eigenvectors of acyclic matrices
- The edge chromatic number of a directed/mixed multigraph
- Rank one perturbation and its application to the laplacian spectrum of a graph∗
- The Laplacian Spectrum of a Graph II
- Spectral Integral Variations of Degree Maximal Graphs
- Edge version of the matrix tree theorem for trees
- On Spectral Integral Variations of Graphs
- A relation between the matching number and Laplacian spectrum of a graph
This page was built for publication: On spectral integral variations of mixed graphs