论文部分内容阅读
Some results on extreme theory of graph spectra
【机 构】
：
Department of Mathematics, Yancheng Teachers University, Yancheng, 224002,Jiangsu, China
【出 处】
：
第六届全国组合数学与图论大会
【发表日期】
：
2014年期
其他文献
Let G be a simple undirected graph with n vertices.A stable set of a graph G is a set of vertices no two of which are adjacent.The cardinality of a maximum stab
会议
Gyárfás conjectured that for every tree T, there exists an integer-valued function fT(x) such that every graph G of chromatic number larger than fT(ω(G)) con
会议