Triangle-free graphs with six non-zero eigenvalues
被引:3
|
作者:
Duan, Fang
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Normal Univ, Sch Math Sci, Urumqi 830017, Xinjiang, Peoples R ChinaXinjiang Normal Univ, Sch Math Sci, Urumqi 830017, Xinjiang, Peoples R China
Duan, Fang
[1
]
Zhang, Weijuan
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Normal Univ, Sch Math Sci, Urumqi 830017, Xinjiang, Peoples R ChinaXinjiang Normal Univ, Sch Math Sci, Urumqi 830017, Xinjiang, Peoples R China
Zhang, Weijuan
[1
]
机构:
[1] Xinjiang Normal Univ, Sch Math Sci, Urumqi 830017, Xinjiang, Peoples R China
A graph G is called triangle-free if G does not contain a triangle as an induced subgraph. Let H-n be the set of triangle-free graphs of order n with six non-zero eigenvalues. In this paper, we find 19 graphs of H-n, and we show that the other graphs of H-n can be constructed from these 19 graphs by adding some congruent vertices. Hence we completely characterize the triangle-free graphs with six non-zero eigenvalues.
机构:
Xinjiang Normal Univ, Sch Math Sci, Urumqi 830017, Xinjiang, Peoples R ChinaXinjiang Normal Univ, Sch Math Sci, Urumqi 830017, Xinjiang, Peoples R China
Duan, Fang
INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS,
2023,