节点文献
色数与谱半径和生成偶子图(英文)
Chromatic Number,Spectral Radius and Spanning Bipartite Subgraph
【摘要】 设G为n≥1阶简单无向图,ρ(G)和μ(G)分别表示图G的邻接谱谱半径和Laplacian谱谱半径.利用生成偶子图证明了:当k为偶数时,ρ(G)≤k-1/kμ(G);当k为奇数时,ρ(G)≤k/k+1μ(G).其中k(≥1)为简单图G的色数.
【Abstract】 Let G be a simple undirected graph with order n≥1.Denote by ρ(G) and μ(G) the spectral radius of the adjacency matrix and the Laplacian matrix of G,respectively.In this paper,by the way of spanning bipartite subgraphs,it is showed that:let G be a simple graph with chromatic number k≥1.If k is even,ρ(G)≤k-1/kμ(G);if k is odd,ρ(G)≤k/k+1μ(G).
【关键词】 谱半径;
Laplacian谱半径;
色数;
生成偶子图;
【Key words】 spectral radius; Laplacian spectral radius; chromatic number; spanning bipartite subgraph;
【Key words】 spectral radius; Laplacian spectral radius; chromatic number; spanning bipartite subgraph;
【基金】 Natural Science Foundation of China(10671074)
- 【文献出处】 吉首大学学报(自然科学版) ,Journal of Jishou University(Natural Sciences Edition) , 编辑部邮箱 ,2009年04期
- 【分类号】O157.5
- 【下载频次】29