On Graphs whose Orientations are Determined by their Hermitian Spectra

Author:

Wang Yi,Yuan Bo-Jun

Abstract

A mixed graph $D$ is obtained from a simple graph $G$, the underlying graph of $D$, by orienting some edges of $G$. A simple graph $G$ is said to be ODHS (all orientations of $G$ are determined by their $H$-spectra) if every two $H$-cospectral graphs in $\mathcal{D}(G)$ are switching equivalent to each other, where $\mathcal{D}(G)$ is the set of all mixed graphs with $G$ as their underlying graph. In this paper, we characterize all bicyclic ODHS graphs and construct infinitely many ODHS graphs whose cycle spaces are of dimension $k$. For a  connected graph $G$ whose cycle space is of dimension $k$, we also obtain an achievable upper bound $2^{2k-1} + 2^{k-1}$ for the number of switching equivalence classes in $\mathcal{D}(G)$, which naturally is an upper bound of the number of  cospectral classes in $\mathcal{D}(G)$. To achieve these, we propose a valid method to estimate the number of switching equivalence classes in $\mathcal{D}(G)$ based on the strong cycle basis, a special cycle basis  introduced in this paper.

Publisher

The Electronic Journal of Combinatorics

Subject

Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3