The spectral radius of edge chromatic critical graphs
Linear Algebra and its Applications(2016)
摘要
A connected graph G with maximum degree Δ and edge chromatic number χ′(G)=Δ+1 is called Δ-critical if χ′(G−e)=Δ for every edge e of G. In this paper, we consider two weaker versions of Vizing's conjecture, which concern the spectral radius ρ(G) and the signless Laplacian spectral radius μ(G) of G. We obtain some lower bounds for ρ(G) and μ(G), and present some cases where the conjectures are true. Finally, several open problems are also proposed.
更多查看译文
关键词
05C50,15A18
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要