51
Views
2
CrossRef citations to date
0
Altmetric
Miscellany

New upper bounds for the integrity of cubic graphs

, &
Pages 1341-1348 | Received 28 Jan 2004, Published online: 25 Jan 2007
 

Abstract

Integrity, a measure of network to reliability, is defined as

where G is a graph with vertex set V, and m(G − S) denotes the order of the largest component of G − S. Let V = n. It is known that (n/3) + O(√n) is a general upper bound for the integrity of any cubic graph. In this article, several theorems are shown that improve this general upper bound. For some families of cubic graphs, an upper bound for the integrity of (n/4) + O(√n) can be established using these theorems.

Acknowledgement

C. Ernst was partially supported by NSF Grant #DMS-0310562.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.