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

DOI10.1016/J.DISC.2017.01.018MaRDI QIDQ2401796zbMATH OpenOpenAlexFDO

Authors 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

algebraic graph theorycospectral digraphsdirected grapheigenvalue

Mathematics Subject Classification ID

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

Recommendations

• Mixed paths and cycles determined by their spectrum
• The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
• Hermitian energy and Hermitian Estrada index of digraphs
• On mixed graphs whose Hermitian spectral radii are at most 2

Cites work

• Can One Hear the Shape of a Drum?
• Constructing cospectral graphs
• Developments on spectral characterizations of graphs
• Equiangular lines
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• scientific article; zbMATH DE number 3627232 (Why is no real title available?)
• scientific article; zbMATH DE number 637070 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 3394189 (Why is no real title available?)
• scientific article; zbMATH DE number 3411062 (Why is no real title available?)
• Some new characterizations of the Chebyshev polynomials
• Spectra of graphs
• Spektren endlicher Grafen
• Theory of monomer-dimer systems
• Which graphs are determined by their spectrum?

Cited in

(19)

• Interlacing families and the Hermitian spectral norm of digraphs
• Some mixed graphs with \(H\)-rank 4, 6 or 8
• 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
• 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
• 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
• 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
• Hermitian Adjacency Spectrum of Cayley Digraphs over Dihedral Group
• 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 the characteristic polynomial and energy of Hermitian quasi-Laplacian matrix of mixed graphs
• The Hoffman program for mixed graphs
• Developments on the Hoffman program of graphs

Describes a project that uses

Uses Software

• SageMath

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401796)