Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths

DOI10.1016/j.disc.2017.01.018zbMath1369.05092OpenAlexW2590589653MaRDI QIDQ2401796

Krystal Guo, Bojan Mohar

Publication date: 5 September 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.01.018

zbMATH Keywords

eigenvaluedirected graphalgebraic graph theorycospectral digraphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \) ⋮ On extremal spectral results of digraphs based on sum distance ⋮ Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra ⋮ Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\) ⋮ Characterizing signed mixed graphs with small eigenvalues ⋮ On graphs whose orientations are determined by their Hermitian spectra ⋮ On mixed graphs whose Hermitian spectral radii are at most 2 ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ Some mixed graphs with \(H\)-rank 4, 6 or 8 ⋮ Graphs whose \(A_\alpha \) -spectral radius does not exceed 2 ⋮ The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum ⋮ Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\) ⋮ Maximal digraphs whose Hermitian spectral radius is at most 2 ⋮ Hermitian adjacency matrix of the second kind for mixed graphs

Uses Software

• SageMath

Cites Work

• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Constructing cospectral graphs
• Spectra of graphs
• Spektren endlicher Grafen
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• Developments on spectral characterizations of graphs
• Some new characterizations of the Chebyshev polynomials
• Which graphs are determined by their spectrum?
• Large regular bipartite graphs with median eigenvalue 1
• Theory of monomer-dimer systems
• Equiangular lines
• Can One Hear the Shape of a Drum?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths