Author： Kirkland S.
Publisher： Taylor & Francis Ltd
ISSN： 0308-1087
Source： Linear and Multilinear Algebra, Vol.50, Iss.3, 2002-01, pp. : 253-284
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Let G be a graph on n vertices with vertex connectivity v with 1 
v n - 2. We produce an attainable upper bound on the absolute algebraic connectivity of G in terms of n and v.
Related content
Algebraic connectivity of directed graphs
By Wu Chai Wah
Linear and Multilinear Algebra, Vol. 53, Iss. 3, 2005-06 ,pp. :
Access to resources
Recommend
Maximizing Algebraic Connectivity Over Unicyclic Graphs
Linear and Multilinear Algebra, Vol. 51, Iss. 3, 2003-09 ,pp. :
On the Connectivity of Visibility Graphs
By Payne Michael Pór Attila Valtr Pavel Wood David
Discrete & Computational Geometry, Vol. 48, Iss. 3, 2012-10 ,pp. :
The connectivity of total graphs
Bulletin of the Australian Mathematical Society, Vol. 1, Iss. 2, 1969-08 ,pp. :
On the connectivity of certain graphs of high girth
Discrete Mathematics, Vol. 277, Iss. 1, 2004-02 ,pp. :