摘要
证明n(n≥22)阶具有完美匹配的单圈图的代数连通度不超过(3-5^(1/2))/2,我们同时确定了代数连通度达到(3-5^(1/2))/2的所有n(n≥22)阶具有完美匹配的单圈图。
It was proved thatthe algebraic connectivity of any unicyclic graph of order n (n ≥22) with perfect matching does not exceed (3-√5)/2 All the unieyelie graphs of order n ( n ≥22) with perfect matching whose algebraic connectivity attains (3-√5)/2were also determind.
出处
《上海工程技术大学学报》
CAS
2007年第2期157-161,共5页
Journal of Shanghai University of Engineering Science