The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum

DOI10.1016/j.jcta.2020.105232zbMath1442.05078arXiv1903.09531OpenAlexW3006557542MaRDI QIDQ2306004

Pepijn Wissing, van Dam, Edwin R.

Publication date: 20 March 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.09531

zbMATH Keywords

cospectral digraphsHermitian adjacency matrixspectra of digraphsspectral characterization of digraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (12)

Unit gain graphs with two distinct eigenvalues and systems of lines in complex space ⋮ Spectral characterizations of tournaments ⋮ Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \) ⋮ Self-converse mixed graphs are extremely rare ⋮ Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra ⋮ On -gain graphs with few positive eigenvalues ⋮ Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\) ⋮ On the inertia index of a mixed graph in terms of the matching number ⋮ On graphs whose orientations are determined by their Hermitian spectra ⋮ Spectral fundamentals and characterizations of signed directed graphs ⋮ The spectra of digraphs with Morita equivalent \(C^\ast\)-algebras ⋮ Hermitian adjacency matrix of the second kind for mixed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Skew-adjacency matrices of graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• The spectral distribution of random mixed graphs
• Mixed graphs with \(H\)-rank 3
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Interlacing families and the Hermitian spectral norm of digraphs
• Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
• Laplacians and the Cheeger inequality for directed graphs
• Interlacing eigenvalues and graphs
• A regularity lemma and twins in words
• Cyclotomic matrices over the Eisenstein and Gaussian integers
• Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
• Large regular bipartite graphs with median eigenvalue 1
• On the Shannon capacity of a graph
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• Using twins and scaling to construct cospectral graphs for the normalized Laplacian
• Enumeration of self‐converse digraphs
• The Number of Linear, Directed, Rooted, and Connected Graphs

This page was built for publication: The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum