On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs
Authors: Kirkland S.1; Pati S.2
Source: Linear and Multilinear Algebra, Volume 50, Number 3, 1 January 2002 , pp. 253-284(32)
Publisher: Taylor and Francis Ltd
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.
Keywords: Absolute algebraic connectivity; Laplacian matrix; Weighted graph; Vertex connectivity
Document Type: Research article
Affiliations: 1: Department of Mathematics and Statistics, University of Regina, Regina, Saskatchewan, S4S 0A2, Canada 2: Department of Mathematics, IIT Guwahati, Assam, India - 781 039
Publication date: 2002-01-01
- In this: publication
- By this: publisher
- In this Subject: Mathematics and Statistics
- By this author: Kirkland S. ; Pati S.

Shopping cart
Receive new issue alert