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
基金
中国国家自然科学基金;
关键词
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 条
  • [31] BOUNDS ON THE SUM OF MINIMUM SEMIDEFINITE RANK OF A GRAPH AND ITS COMPLEMENT
    Narayan, Sivaram K.
    Sharawi, Yousra
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2018, 34 : 399 - 406
  • [32] Bounds for Degree-Sum adjacency eigenvalues of a graph in terms of Zagreb indices
    Shinde, Sumedha S.
    Swamy, Narayan
    Gudimani, Shaila B.
    Ramane, H. S.
    COMPUTER SCIENCE JOURNAL OF MOLDOVA, 2021, 29 (02) : 271 - 283
  • [33] On the determinant of the Laplacian matrix of a complex unit gain graph
    Wang, Yi
    Gong, Shi-Cai
    Fan, Yi-Zheng
    DISCRETE MATHEMATICS, 2018, 341 (01) : 81 - 86
  • [34] Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
    Wang, Long
    Wong, Dein
    DISCRETE APPLIED MATHEMATICS, 2014, 166 : 276 - 281
  • [35] Bounds and extremal graphs for the energy of complex unit gain graphs
    Samanta, Aniruddha
    Kannan, M. Rajesh
    arXiv, 2023,
  • [36] A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
    Wang, Zhi-Wen
    Guo, Ji-Ming
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2020, 584 (584) : 287 - 293
  • [37] Bounding the number of cycles in a graph in terms of its degree sequence
    Dvorak, Zdenek
    Morrison, Natasha
    Noel, Jonathan A.
    Norin, Sergey
    Postle, Luke
    EUROPEAN JOURNAL OF COMBINATORICS, 2021, 91
  • [38] Bounds on the Dynamic Chromatic Number of a Graph in Terms of its Chromatic Number
    Vlasova N.Y.
    Karpov D.V.
    Journal of Mathematical Sciences, 2018, 232 (1) : 21 - 24
  • [39] BOUNDS FOR THE METRIC DIMENSION OF A GRAPH IN TERMS OF ITS DIAMETER AND NUMBER OF VERTICES
    YUSHMANOV, SV
    VESTNIK MOSKOVSKOGO UNIVERSITETA SERIYA 1 MATEMATIKA MEKHANIKA, 1987, (01): : 68 - 70
  • [40] Complex unit gain bicyclic graphs with rank 2, 3 or 4
    Lu, Yong
    Wang, Ligong
    Xiao, Peng
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2017, 523 : 169 - 186