Self-converse mixed graphs are extremely rare

DOI10.1016/J.DISC.2022.112989MaRDI QIDQ2144585zbMATH OpenOpenAlexFDO

Authors Pepijn Wissing

Publication date 14 June 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

digraphmixed graphself-converse

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: A mixed graph is cospectral to its converse, with respect to the usual adjacency matrices. Hence, it is easy to see that a mixed graph whose eigenvalues occur uniquely, up to isomorphism, must be isomorphic to its converse. It is therefore natural to ask whether or not this is a common phenomenon. This note contains the theoretical evidence to confirm that the fraction of self-converse mixed graphs tends to zero.

Recommendations

• Generalized spectral characterization of mixed graphs
• Spectral characterization of mixed extensions of small graphs
• Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
• Mixed paths and cycles determined by their spectrum
• Hermitian adjacency spectrum and switching equivalence of mixed graphs

Cites work

• Enumeration of self‐converse digraphs
• Graph theory
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
• The Number of Linear, Directed, Rooted, and Connected Graphs
• Which graphs are determined by their spectrum?

This page was built for publication: Self-converse mixed graphs are extremely rare

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