Premium
Lower‐bounds on the connectivities of a graph
Author(s) -
Esfahanian Abdol H.
Publication year - 1985
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190090411
Subject(s) - combinatorics , mathematics , graph , connectivity , discrete mathematics , upper and lower bounds , mathematical analysis
This article presents a study of the connectivities of a graph as a function of other graph parameters such as the number of vertices, the maximum degree, and the diameter. As a result, lower‐bounds on the connectivities of a graph as a function of these parameters are computed. These bounds could serve as sufficient conditions for a graph to be h ‐edge‐connected or k ‐connected. Consequently, the connectivity characteristics of many of the densest known graphs are determined.