版权说明 操作指南
首页 > 成果 > 详情

The k-generalized Hermitian adjacency matrices for mixed graphs

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Yu, Yuantian;Geng, Xianya;Zhou, Zihan
通讯作者:
Xianya Geng
作者机构:
[Yu, Yuantian; Zhou, Zihan] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China.
[Geng, Xianya] Anhui Univ Sci & Technol, Sch Math & Big Data, Huainan, Peoples R China.
通讯机构:
[Xianya Geng] S
School of Mathematics and Big Data, Anhui University of Science & Technology, Huainan, China
语种:
英文
关键词:
Cospectrality;Hk-rank;Mixed graph;Spectral determination
期刊:
Discrete Mathematics
ISSN:
0012-365X
年:
2023
卷:
346
期:
2
页码:
113254
基金类别:
We thank Professor Shuchao Li for lots of remarks and suggestions on this article. This work is financial support from the National Natural Science Foundation of China (Grant Nos. 12171190 , 11671164 ) and the Graduate Education Innovation Grant from Central China Normal University (Grant No. 2022CXZZ086 ).
机构署名:
本校为第一机构
院系归属:
数学与统计学学院
摘要:
This article gives some fundamental introduction to spectra of mixed graphs via its kgeneralized Hermitian adjacency matrix. This matrix is indexed by the vertices of the mixed graph, and the entry corresponding to an arc from uto vis equal to the kth root of unity e(-2pi/k) (and its symmetric entry is e(-2pi/k)); the entry corresponding to an undirected edge is equal to 1, and 0 otherwise. For all positive integers k, the non-zero entries of the above matrix are chosen from the gain set {1, e(2pi/k), e(-2pi/k)}, which is not closed under multiplication when k >= 4. In this paper, for all posi...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com