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

Buy & download fulltext article:

OR

Price: $56.94 plus tax (Refund Policy)

Abstract:

Let G be a graph on n vertices with vertex connectivity v with 1 le v le 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

Related content

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page