Journal
LINEAR ALGEBRA AND ITS APPLICATIONS
Volume 489, Issue -, Pages 324-340Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.laa.2015.10.018
Keywords
Mixed graph; Digraph; Hermitian adjacency matrix; Spectral characterization; Switching equivalence; Eigenvalue; Spectral radius
Categories
Funding
- NSERC Discovery Grant (Canada)
- Canada Research Chairs program
- ARRS (Slovenia) [P1-0297]
Ask authors/readers for more resources
It is shown that an undirected graph G is cospectral with the Hermitian adjacency matrix of a mixed graph D obtained from a subgraph H of G by orienting some of its edges if and only if H = G and D is obtained from G by a four-way switching operation; if G is connected, this happens if and only if lambda(1) (G) = lambda(1) (D). 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. (C) 2015 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available