College of Science, Beijing University of Chemical Technology，Beijing 100029, China
{{custom_zuoZheDiZhi}}
{{custom_authorNodes}}
{{custom_bio.content}}
{{custom_bio.content}}
{{custom_authorNodes}}
Collapse
History+
Received
Revised
Published
2004-12-14
1900-01-01
2005-12-10
Issue Date
2005-12-10
Abstract
For any positive integersm, n and k, and nonnegative integer l, a graphG is said to be an (m, k, l; n) graph, if each vertex of G belongs to both an (m+1) clique and an independent (n+1)set, and there are at leastldistinct (m+k+1)cliques inG. In this paper, a necessary and sufficient condition for the existence of an (m, k, l; n) graph of order p was given.
GUO Qiu-min.
On cliques and independent sets[J]. Journal of Beijing University of Chemical Technology, 2005, 32(6): 79-81
{{custom_sec.title}}
{{custom_sec.title}}
{{custom_sec.content}}
References
[1 ] Entringer R C , Goddard W , Henning M A. A note on cliques and independent sets[J ] . J Graph Theory , 1997 ,24 : 21 - 23 [2 ] Fred Galvin. Another note on cliques and independent sets[J ] . J Graph Theory , 2000 , 35 : 173 - 175 [3 ] Bondy J A , Murty U S R. Graph Theory with Applications[M] . London : Macmillan , 1976 [4 ] Chartrand G, Lesniak L. Graphs & Diagraphs [ M ] .Third Edition. Monterey : Wadsworth & Brooks Cole ,1996 [5 ] 王朝瑞. 图论[M] . 第三版. 北京:北京理工大学出版社, 2001
PDF(157 KB)
