Some Mixed Graphs Determined by Their Spectrum
S. Akbari, A. Ghafari, M. Nahvi, M.A. Nematollahi

TL;DR
This paper investigates which mixed graphs are uniquely identified by their Hermitian spectrum, focusing on cycles and paths, and classifies their spectral properties and cospectral mates.
Contribution
It characterizes all mixed paths and cycles that are determined by their Hermitian spectrum, expanding understanding of spectral graph determination in mixed graphs.
Findings
All mixed paths of even order except P8 and P14 are DHS.
Mixed paths of odd order except P3 are not DHS.
Certain mixed cycles are DHS, while others are not.
Abstract
A mixed graph is obtained from a graph by orienting some of its edges. The Hermitian adjacency matrix of a mixed graph with the vertex set , is the matrix , where if there is a directed edge from to , if there exists an undirected edge between and , and otherwise. The Hermitian spectrum of a mixed graph is defined to be the spectrum of its Hermitian adjacency matrix. In this paper we study mixed graphs which are determined by their Hermitian spectrum (DHS). First, we show that each mixed cycle is switching equivalent to either a mixed cycle with no directed edges (), a mixed cycle with exactly one directed edge (), or a mixed cycle with exactly two consecutive directed edges with the same direction () and we determine the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Computational Drug Discovery Methods
