Bound for the algebraic connectivity of Nordhaus-Gaddum type for unicyclic graphs(单圈图的N-G型的代数连通度的界)
对任一个n阶单图G,用a(G)表示G的代数连通度,证明了对任一n阶单圈图G,有1 ≤ a(G)+a(Gc).
Main Authors: | LüDa-mei(吕大梅), LüJia-jun(吕嘉钧) |
---|---|
Format: | Article |
Language: | zho |
Published: |
Zhejiang University Press
2006-07-01
|
Series: | Zhejiang Daxue xuebao. Lixue ban |
Subjects: | |
Online Access: | https://doi.org/zjup/1008-9497.2006.33.4.368-371 |
Similar Items
-
图的Nordhaus-Ghaddumm型的代数连通度的界(A sharp lower bound for the algebraic connectivity of the Nordhaus- Gaddumm type)
by: LÜDa-mei,(吕大梅), et al.
Published: (2009-11-01) -
On hamiltonicity of 3-connected P3-dominated graphs(3-连通P3-支配图的Hamilton性)
by: TIANRun-li(田润丽), et al.
Published: (2010-07-01) -
启发式P圈构造算法的研究和改进
by: 尼俊红, et al.
Published: (2016-01-01) -
The Γ graphs of the monogenic semigroups(单演半群的Γ图)
by: FANXinman(樊馨蔓), et al.
Published: (2014-05-01) -
BCK-Algebras with Order n≤5(阶n≤5的有条件(S)的BCK-代数)
by: WANGGuo-jun(汪国军)
Published: (1999-05-01)