摘要
一个图G(V,E)的控制数γ(G)是V的这样一个子集S的最小基数,使得G中每一个顶点或者在S中或者和S中的一些顶点邻接.讨论给定控制数1,2,n/2的树的代数连通度,得出树T*=K1,y-1°K1具有最大的代数连通度;同时利用移接变形刻画出给定控制数2的树中具有最小代数连通度的极图,得出树T=T3(s3,t3)具有最小的代数连通度.
The domination number γ（G） of a graph G（V,E） is the minimum cardinality of a subset of V, and it makes every vertex is either in the set S or adjacent to some vertices in theset S. In this paper, the algebraic connectivity of the tree T＊ = K1,y-1° K1 with given domination number 1, 2,n/2 was discussed, and the conclusion of the tree has the largest algebraic connectivity was got. At the same time, the polar graph with the smallest algebraic connectivity among trees in a given domination number 2 was depicted by using of shift in deformation, and the conclusion of the tree T = T3 （s3 , t3 ） has the smallest algebraic connectivity was got.
出处
《西安文理学院学报（自然科学版）》
2016年第1期5-7,共3页
Journal of Xi’an University(Natural Science Edition)
关键词
控制数
树
代数连通度
domination number
trees
algebraic connectivity
