On graphs whose orientations are determined by their Hermitian spectra
Summary: A mixed graph \(D\) is obtained from a simple graph \(G\), the underlying graph of \(D\), by orienting some edges of \(G\). A simple graph \(G\) is said to be ODHS (all orientations of \(G\) are determined by their \(H\)-spectra) if every two \(H\)-cospectral graphs in \(\mathcal{D}(G)\) are switching equivalent to each other, where \(\mathcal{D}(G)\) is the set of all mixed graphs with \(G\) as their underlying graph. In this paper, we characterize all bicyclic ODHS graphs and construct infinitely many ODHS graphs whose cycle spaces are of dimension \(k\). For a connected graph \(G\) whose cycle space is of dimension \(k\), we also obtain an achievable upper bound \(2^{2k-1} + 2^{k-1}\) for the number of switching equivalence classes in \(\mathcal{D}(G)\), which naturally is an upper bound of the number of cospectral classes in \(\mathcal{D}(G)\). To achieve these, we propose a valid method to estimate the number of switching equivalence classes in \(\mathcal{D}(G)\) based on the strong cycle basis, a special cycle basis introduced in this paper.
- 3-regular mixed graphs with optimum Hermitian energy
- A Theorem on n-Coloring the Points of a Linear Graph
- Cycles through specified vertices of a graph
- Developments on spectral characterizations of graphs
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Hermitian Laplacian matrix and positive of mixed graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- scientific article; zbMATH DE number 4187837 (Why is no real title available?)
- Interlacing families and the Hermitian spectral norm of digraphs
- Mixed graphs with \(H\)-rank 3
- Nullity of Hermitian-adjacency matrices of mixed graphs
- On cycle bases of a graph
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
- The spectral distribution of random mixed graphs
- Which graphs are determined by their spectrum?
- Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
- scientific article; zbMATH DE number 7666851 (Why is no real title available?)
- Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\)
- The Hoffman program for mixed graphs
This page was built for publication: On graphs whose orientations are determined by their Hermitian spectra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200431)
