Barefoot, C.A., Entringer, R. and Swart, H.C. (1987) Vulnerability in Graphs—A Comparative Survey. Journal of Combinatorial Mathematics and Combinatorial Computing, 1, 13-22.
has been cited by the following article:
TITLE: Rupture Degree of Some Cartesian Product Graphs
AUTHORS: Yinkui Li, Tingyi Zhu
KEYWORDS: The Rupture Degree, Cartesian Product, The Vulnerability
JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.13 No.1, January 12, 2023
ABSTRACT: The rupture degree of a noncomplete-connected graph G is defined by , where is the number of components of and is the order of the largest component of. In this paper, we determine the rupture degree of some Cartesian product graphs.