Abstract
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 λ1(G)=λ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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
