On triangle-free graphs with rank 7

被引：0
作者：
Duan, Fang [1 ]
机构：
[1] Xinjiang Normal Univ, Sch Math Sci, Urumqi 830017, Xinjiang, Peoples R China
来源：
INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS | 2025年 / 56卷 / 01期
关键词：
Triangle-free graph; Rank; Congruent vertex; Nullity;
D O I：
10.1007/s13226-023-00480-5
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
If G does not contain triangle as induced subgraph, then G is called triangle-free. In this paper, by using the congruent vertices of I-. II- and III-type, we give a complete characterization for the triangle-free graphs with rank 7.
引用
收藏
页码：295 / 304
页数：10
相关论文
共 50 条
[31]   Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids [J].
Levit, V. E. ;
Mandrescu, Eugen .
DISCRETE APPLIED MATHEMATICS, 2007, 155 (18) :2414-2425
[32]   Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree [J].
Wang, Xiao ;
Wu, Baoyindureng .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (01) :28-34
[33]   Triangle-free 2P3-free graphs are 4-colorable [J].
Pyatkin, Artem V. .
DISCRETE MATHEMATICS, 2013, 313 (05) :715-720
[34]   Smallest regular and almost regular triangle-free graphs without perfect matchings [J].
Volkmann, Lutz .
ARS COMBINATORIA, 2013, 111 :463-472
[35]   Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected [J].
Meierling, Dirk ;
Volkmann, Lutz .
DISCRETE APPLIED MATHEMATICS, 2012, 160 (12) :1775-1781
[36]   3-CHOOSABILITY OF TRIANGLE-FREE PLANAR GRAPHS WITH CONSTRAINTS ON 4-CYCLES [J].
Dvorak, Zdenek ;
Lidicky, Bernard ;
Skrekovski, Riste .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (03) :934-945
[37]   On degree sums of a triangle-free graph [J].
Brandt, Stephan ;
Harant, Jochen ;
Naumann, Steffi .
DISCRETE MATHEMATICS, 2014, 337 :76-82
[38]   Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected [J].
Yuan, Jun ;
Liu, Aixia .
INFORMATION PROCESSING LETTERS, 2016, 116 (02) :163-167
[39]   On distance-regular graphs G of diameter 3 for which G??????3 is a triangle-free graph [J].
Makhnev, Aleksandr A. ;
Guo, Wenbin .
DISCRETE MATHEMATICS AND APPLICATIONS, 2023, 33 (04) :199-204
[40]   An upper bound on the extremal version of Hajnal's triangle-free game [J].
Biro, Csaba ;
Horn, Paul ;
Wildstrom, D. Jacob .
DISCRETE APPLIED MATHEMATICS, 2016, 198 :20-28
12345