Largest eigenvalue of a unicyclic mixed graphs
From MaRDI portal
Publication:1764382
DOI10.1007/s11766-004-0047-4zbMath1059.05072OpenAlexW1999188886MaRDI QIDQ1764382
Publication date: 24 February 2005
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-004-0047-4
Related Items
On the spectrum of 3-coloured digraphs ⋮ Nonsingular mixed graphs with few eigenvalues greater than two ⋮ Spectral characterizations of signed cycles ⋮ On the spectrum of some signed complete and complete bipartite graphs ⋮ Spectral integral variation and unicyclic 3-colored digraphs with second smallest eigenvalue 1 ⋮ A note on the nullity of unicyclic signed graphs ⋮ On weight-symmetric 3-coloured digraphs ⋮ Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case ⋮ Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order ⋮ On weighted directed graphs ⋮ Unoriented Laplacian maximizing graphs are degree maximal ⋮ The nullity of bicyclic signed graphs ⋮ Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case ⋮ Graphs with maximal signless Laplacian spectral radius ⋮ A characterization of signed planar graphs with rank at most 4 ⋮ Spectra of cycle and path families of oriented hypergraphs ⋮ The signless Laplacian spread ⋮ The inertia indices of a signed graph in terms of the inertia indices of its underlying graph ⋮ Spectral characterizations of signed lollipop graphs
Cites Work
- The Laplacian spectrum of a mixed graph
- A note on Laplacian graph eigenvalues
- On the Laplacian eigenvalues of a graph
- Laplacian matrices of graphs: A survey
- Algebraic graph theory without orientation
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- On spectral integral variations of mixed graphs
- An always nontrivial upper bound for Laplacian graph eigenvalues
- The Laplacian eigenvalues of mixed graphs
- Matrix Analysis
- Eigenvalues of the Laplacian of a graph∗
- Generalized matrix tree theorem for mixed graphs
- The edge chromatic number of a directed/mixed multigraph
- Edge version of the matrix tree theorem for trees
- On the Laplacian Eigenvalues of Signed Graphs
- A relation between the matching number and Laplacian spectrum of a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item