Li, Y.K. (2006) An Algorithm for Computing the Rupture Degree of Tree. Computer Engineering and Applications, 42, 52-54.

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.