Hermitian adjacency spectrum and switching equivalence of mixed graphs

DOI10.1016/j.laa.2015.10.018zbMath1327.05215arXiv1505.03373OpenAlexW2143176167MaRDI QIDQ891549

Publication date: 17 November 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

eigenvalue digraph spectral radius mixed graph spectral characterization switching equivalence Hermitian adjacency matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Spectral characterizations of tournaments ⋮ Bounds for the rank of a complex unit gain graph in terms of the independence number ⋮ Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths ⋮ 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 ⋮ On the relation between theH-rank of a mixed graph and the matching number of its underlying graph ⋮ 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 ⋮ Quantum state transfer on integral oriented circulant graphs ⋮ Why and how to add direction to a quantum walk ⋮ On the inertia index of a mixed graph in terms of the matching number ⋮ On graphs whose orientations are determined by their Hermitian spectra ⋮ Transport properties in directed quantum walks on the line ⋮ Unnamed Item ⋮ Interlacing families and the Hermitian spectral norm of digraphs ⋮ Hermitian normalized Laplacian matrix for directed networks ⋮ Minors of Hermitian (quasi-) Laplacian matrix of a mixed graph ⋮ Large regular bipartite graphs with median eigenvalue 1 ⋮ Generalized spectral characterization of mixed graphs ⋮ On mixed graphs whose Hermitian spectral radii are at most 2 ⋮ Projecting signed two-mode networks ⋮ 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 ⋮ Hermitian Laplacian matrix and positive of mixed graphs ⋮ Principal minor version of matrix-tree theorem for mixed graphs ⋮ Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs ⋮ Mixed graphs with \(H\)-rank 3 ⋮ On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs ⋮ Some mixed graphs with \(H\)-rank 4, 6 or 8 ⋮ Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph ⋮ On the largest eigenvalue of a mixed graph with partial orientation ⋮ Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph ⋮ The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum ⋮ Spectral fundamentals and characterizations of signed directed graphs ⋮ Hermitian energy and Hermitian Estrada index of digraphs ⋮ The relation between the H-rank of a mixed graph and the independence number of its underlying graph ⋮ The spectra of digraphs with Morita equivalent \(C^\ast\)-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

Cites Work

This page was built for publication: Hermitian adjacency spectrum and switching equivalence of mixed graphs