The
rupture degree of a noncomplete-connectedgraph 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.
References
[1]
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.
[2]
Li, Y.K., Zhang, S.G. and Li, X.L. (2005) Rupture Degree of Graphs. International Journal of Computer Mathematics, 82, 793-803. https://doi.org/10.1080/00207160412331336062
[3]
Li, Y.K. (2006) An Algorithm for Computing the Rupture Degree of Tree. Computer Engineering and Applications, 42, 52-54.
[4]
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.
[5]
Bondy, J.A. and Murty, U.S.R. (1976) Graph Theory with Applications. Macmillan, London; Elsevier, New York.
![\"\"](\"Edit_992aeb19-aeae-4168-928e-94d0ada5ef37.png\")
![\"\"](\"Edit_4f3aa2ac-1ce6-4ed6-ab39-ceb98493369c.png\")
![\"\"](\"Edit_b205fd70-cbd3-43fe-a15f-2dbd74bd84bd.png\")
![\"\"](\"Edit_19d0a791-1085-4226-b021-2f31b589f4ef.png\")
![\"\"](\"Edit_0914d59c-688e-4e44-a59a-6a907e773607.png\")
