Inertia indices of a complex unit gain graph in terms of matching number
Inertia indices of a complex unit gain graph in terms of matching number
复制标题
复杂单位增益图的惯性指数(以匹配数表示)
DOI:
10.1080/03081087.2022.2064968
复制
发表时间:
2021-08
影响因子:
1.1
通讯作者:
Yong Lu
中科院分区:
文献类型:
--
作者:
Qi Wu;Yong Lu
A complex unit gain graph is a triple (or for short) consisting of a simple graph G, as the underlying graph of , the set of unit complex numbers and a gain function such that . Let be the adjacency matrix of . In this paper, we prove that where , , and are the number of positive eigenvalues of , the number of negative eigenvalues of , the matching number and the cyclomatic number of G, respectively. Furthermore, we characterize the graphs which attain the upper bounds and the lower bounds, respectively.
登录
查看更多内容
DOI:
10.1016/j.disc.2015.11.023
发表时间:
2016-05
期刊:
Discret. Math.
影响因子:
--
作者:
Long Wang
通讯作者:
Long Wang
影响因子:
4
作者:
Feng Zhimin;Huang Jing;Li Shuchao;Luo Xiaobing
通讯作者:
Luo Xiaobing
影响因子:
1.1
作者:
Shengjie He;Rong-Xia Hao;Hong-Jian Lai
通讯作者:
Hong-Jian Lai
DOI:
10.1016/j.laa.2017.02.031
发表时间:
2015-11
期刊:
arXiv: Combinatorics
影响因子:
--
作者:
Yong Lu;Ligong Wang;Peng Xiao
通讯作者:
Yong Lu;Ligong Wang;Peng Xiao
影响因子:
1.1
作者:
Shengjie He;Rongxia Hao;A. Yu
通讯作者:
Shengjie He;Rongxia Hao;A. Yu