Bounds for the rank of a complex unit gain graph in terms of its maximum degree

被引：8

作者：

Lu, Yong ^{[1
]}

Wu, Jingwen ^{[1
]}

机构：

[1] Jiangsu Normal Univ, Sch Math & Stat, Xuzhou 221116, Jiangsu, Peoples R China

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2021年 / 610卷

基金：

中国国家自然科学基金;

关键词：

Complex unit gain graphs; Rank of graphs; Maximum degree;

D O I：

10.1016/j.laa.2020.09.035

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let Phi = (G, phi) be a T-gain graph with maximum degree Delta. Zhou et al. (2018) [3.5] gave a lower bound of the rank of simple graphs in items of maximum degree. Motivated by above result, in this paper, we extend this result to T-gain graphs. We obtain that r(Phi) >= n/Delta for a T-gain graph. All the corresponding extremal graphs are characterized. Furthermore, we also obtain some other results about the rank of T-gain graphs. (C) 2020 Elsevier Inc. All rights reserved.

引用

页码：73 / 85

页数：13

共 44 条

[41] Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
Garcia-Moreno, E
Salazar, G
JOURNAL OF GRAPH THEORY, 2001, 36 (03) : 168 - 173
[42] On the clique number of the square of a line graph and its relation to maximum degree of the line graph
Faron, Maxime
Postle, Luke
JOURNAL OF GRAPH THEORY, 2019, 92 (03) : 261 - 274
[43] Upper bound of skew energy of an oriented graph in terms of its skew rank
Wang, Long
Fang, Xianwen
LINEAR ALGEBRA AND ITS APPLICATIONS, 2019, 569 : 195 - 205
[44] New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth
Lichiardopol, Nicolas
DISCRETE MATHEMATICS, 2014, 332 : 55 - 59

← 1 2 3 4 5 →