SPECTRAL CHARACTERIZATION OF ODD GRAPHS OK, K-LESS-THAN-OR-EQUAL-TO-6

被引：4

作者：

HUANG, TY ^{[1
]}

机构：

[1] NATL CHIAO TUNG UNIV,DEPT APPL MATH,HSINCHU 30050,TAIWAN

来源：

GRAPHS AND COMBINATORICS | 1994年 / 10卷 / 03期

关键词：

D O I：

10.1007/BF02986671

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let k be an integer with k greater-than-or-equal-to 2. The Odd graph O(k) has the (k - 1)-subsets of {1,2,...,2k - 1} as vertices, and two vertices are adjacent if and only if their corresponding subsets are disjoint. We prove that the odd graphs O(k) (k less-than-or-equal-to 6) are characterized by their spectra among connected regular graphs.

引用

页码：235 / 240

页数：6