Edge Rupture Degree of Graphs-Reference-Cited by-同舟云学术

Edge Rupture Degree of Graphs

Published:2017-12 Issue:08 Volume:28 Page:993-1006
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

Li Yinkui¹,Du Mingzhe²,Li Hongyan³,Wang Xiaolin³

Affiliation:

1. Center for Applied Mathematics, Tianjin University, Weijin Road, Tianjin 300072, P. R. China

2. School of Information Science and Engineering, Central South University, Lushan South Road, Changsha, Hunan 410083, P. R. China

3. Department of Mathematics of Qinghai Nationalities University, Bayi Road, Xining, Qinghai 810000, P. R. China

Abstract

The edge rupture degree of a graph [Formula: see text], as one of measurement parameter of network vulnerability, is defined as [Formula: see text], where [Formula: see text] is the number of components of [Formula: see text] and [Formula: see text] is the order of a largest component of [Formula: see text]. In this paper, general results on the edge-rupture degree of a graph are considered. Firstly, some bounds on edge rupture degree are given. Further, edge rupture degree of some graphs is caculated. Also some results are given about this parameter with others. Finally, we discuss edge rupture degree of the complement graph and give the Nordhaus–Gaddum-type results for edge rupture degree.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054117500356

Reference13 articles.

1. COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS

2. Graph Theory with Applications

3. Toughness and edge-toughness

4. On the edge-integrity of some graphs and their complements