Vol. 11, No. 5, 2018

Download this article
Download this article For screen
For printing
Recent Issues

Volume 15
Issue 2, 185–365
Issue 1, 1–184

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editors’ Interests
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Author Index
Coming Soon
Other MSP Journals
The $k$-diameter component edge connectivity parameter

Nathan Shank and Adam Buzzard

Vol. 11 (2018), No. 5, 845–856

We focus on a network reliability measure based on edge failures and considering a network operational if there exists a component with diameter k or larger. The k-diameter component edge connectivity parameter of a graph is the minimum number of edge failures needed so that no component has diameter k or larger. This implies each resulting vertex must not have a k-neighbor. We give results for specific graph classes including path graphs, complete graphs, complete bipartite graphs, and a surprising result for perfect r-ary trees.

network reliability, connectivity, conditional connectivity, edge failure, graph theory
Mathematical Subject Classification 2010
Primary: 05C05, 05C12, 05C90, 94C15
Received: 11 April 2017
Revised: 22 August 2017
Accepted: 22 August 2017
Published: 2 April 2018

Communicated by Joshua Cooper
Nathan Shank
Mathematics and Computer Science
Moravian College
Bethlehem, PA
United States
Adam Buzzard
Mathematics and Computer Science
Moravian College
Bethlehem, PA
United States