ON THE SPECTRAL MOMENT OF GRAPHS WITH GIVEN CLIQUE NUMBER

被引:3
作者
Li, Shuchao [1 ]
Hu, Shuna [1 ]
机构
[1] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China
基金
中国国家自然科学基金;
关键词
Spectral moment; clique number; chromatic number; TREES; VERTICES; THEOREM;
D O I
10.1216/RMJ-2016-46-1-261
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let L-n,L-t be the set of all nvertex connected graphs with clique number t (2 <= t <= n). For n-vertex connected graphs with given clique number, lexicographic ordering by spectral moments (Sorder) is discussed in this paper. The first Sigma([(n-t-1)/3])(i=1)(n-t-3i) + 1 graphs with 3 <= t <= n-4, and the last few graphs, in the S-order, among are characterized. In addition, all graphs in Ln,nULn,n-1 have an S-order; for the cases t = n-2 and t = n-3, the first three and the first seven graphs in the set L-n,L-t are characterized, respectively.
引用
收藏
页码:261 / 282
页数:22
相关论文
共 23 条
[1]  
[Anonymous], ANN DISCR MATH
[2]  
Bondy J., 2008, GRADUATE TEXTS MATH
[3]   On the spectral moments of unicyclic graphs with fixed diameter [J].
Cheng, Bo ;
Liu, Bolian ;
Liu, Jianxi .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2012, 437 (04) :1123-1131
[4]   Lexicographical ordering by spectral moments of trees with k pendant vertices and integer partitions [J].
Cheng, Bo ;
Liu, Bolian .
APPLIED MATHEMATICS LETTERS, 2012, 25 (05) :858-861
[5]   A TABLE OF CONNECTED GRAPHS ON 6 VERTICES [J].
CVETKOVIC, D ;
PETRIC, M .
DISCRETE MATHEMATICS, 1984, 50 (01) :37-49
[6]   SPECTRA OF UNICYCLIC GRAPHS [J].
CVETKOVIC, D ;
ROWLINSON, P .
GRAPHS AND COMBINATORICS, 1987, 3 (01) :7-23
[7]  
Cvetkovic D. M., 1980, SPECTRAL GRAPHS THEO
[8]   Sharp bounds for the signless Laplacian spectral radius in terms of clique number [J].
He, Bian ;
Jin, Ya-Lei ;
Zhang, Xiao-Dong .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 438 (10) :3851-3861
[9]  
Krivelevich M., 1998, ELECT J COMB, V1
[10]  
Li S.C., ARXIV12092188V1MATHC