Hermitian adjacency spectrum and switching equivalence of mixed graphs
From MaRDI portal
Abstract: It is shown that an undirected graph is cospectral with the Hermitian adjacency matrix of a mixed graph obtained from a subgraph of by orienting some of its edges if and only if and is obtained from by a four-way switching operation; if is connected, this happens if and only if . All mixed graphs of rank 2 are determined and this is used to classify which mixed graphs of rank 2 are cospectral with respect to their Hermitian adjacency matrix. Several families of mixed graphs are found that are determined by their Hermitian spectrum in the sense that they are cospectral precisely to those mixed graphs that are switching equivalent to them.
Recommendations
Cites work
- Can One Hear the Shape of a Drum?
- Constructing cospectral graphs
- Developments on spectral characterizations of 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 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- Spektren endlicher Grafen
- Which graphs are determined by their spectrum?
Cited in
(52)- 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
- Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs
- Principal minor version of matrix-tree theorem for mixed graphs
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- On the largest eigenvalue of a mixed graph with partial orientation
- Spectral fundamentals and characterizations of signed directed graphs
- The spectra of digraphs with Morita equivalent C^-algebras
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- Maximal digraphs whose Hermitian spectral radius is at most 2
- Hermitian adjacency matrix of the second kind for mixed graphs
- Spectral characterizations of tournaments
- Self-converse mixed graphs are extremely rare
- Complex unit gain graphs of rank 2
- Relations between the inertia indices of a mixed graph and those of its underlying graph
- The rank of a complex unit gain graph in terms of the matching number
- Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra
- The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
- On graphs whose orientations are determined by their Hermitian spectra
- Hermitian normalized Laplacian matrix for directed networks
- Generalized spectral characterization of mixed graphs
- On mixed graphs whose Hermitian spectral radii are at most 2
- Godsil-McKay switching for mixed and gain graphs over the circle group
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- 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
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- Why and how to add direction to a quantum walk
- Transport properties in directed quantum walks on the line
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Hermitian energy and Hermitian Estrada index of digraphs
- Projecting signed two-mode networks
- Bounds for the rank of a complex unit gain graph in terms of the independence number
- Minors of Hermitian (quasi-) Laplacian matrix of a mixed graph
- Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- Mixed graphs with \(H\)-rank 3
- scientific article; zbMATH DE number 7666851 (Why is no real title available?)
- Quantum state transfer on integral oriented circulant graphs
- On the inertia index of a mixed graph in terms of the matching number
- On symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphs
- The Hermitian Kirchhoff index and robustness of mixed graph
- On the characteristic polynomial and energy of Hermitian quasi-Laplacian matrix of mixed graphs
- Hermitian Laplacian matrix and positive of mixed graphs
- Developments on the Hoffman program of graphs
- Relation between the H-rank of a mixed graph and the girth of its underlying graph
- Mixed graphs determined by their generalized Hermitian adjacency spectrum based on Eisenstein integers
- Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number
- On spectra of Hermitian Randić matrix of second kind
This page was built for publication: Hermitian adjacency spectrum and switching equivalence of mixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891549)