The average connectivity of a graph

42Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we consider the concept of the average connectivity of a graph, defining it to be the average, over all pairs of vertices, of the maximum number of internally disjoint paths connecting these vertices. Our main results are sharp bounds on the value of this parameter, and a construction of graphs whose average connectivity is the same as the connectivity. Along the way, we establish some new results on connectivity. © 2002 Elsevier Science B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Beineke, L. W., Oellermann, O. R., & Pippert, R. E. (2002). The average connectivity of a graph. Discrete Mathematics, 252(1–3), 31–45. https://doi.org/10.1016/S0012-365X(01)00180-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free