摘要
给出了给定匹配数、点连通度或者色数的图的第二Laplacian谱矩的上界,并刻画了能够取到极值的极图.
The sharp upper bounds for the second Laplacian spectral moment of graphs is presented with given matching number,connectivity and chromatic number,respectively.Moreover,the extremal graphs with the extremal values are obtained.
出处
《南开大学学报(自然科学版)》
CAS
CSCD
北大核心
2013年第1期59-64,共6页
Acta Scientiarum Naturalium Universitatis Nankaiensis
基金
Supported by the Natural Science Foundation of China(10871205,11101245)
the Natural Science Foundation of Shandong Province(BS2010SF017,ZR2001AQ005)
the Young Foundation of Shandong Institute of Business and Technogy(2011QN066)
关键词
图
Laplacian谱矩
匹配数
点连通度
色数
graphs
Laplacian spectral moment
matching number
connectivity
chromatic number