Li, F.W. and Li, X.L. (2004) Computing the Rupture Degrees of Graphs. Proceedings of 7th International Symposium on Parallel Architectures, Algorithms and Networks, Hong Kong, 10-12 May 2004, 368-373.

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.