Research ArticleOpen AccessGoogle Scholar indexed
Rupture Degree of Some Cartesian Product Graphs
Department of Mathematics, Qinghai Nationalities College, Xining, China
Department of Mathematics, Qinghai Nationalities College, Xining, China
- 1 Department of Mathematics, Qinghai Nationalities College, Xining, China
- 2 Department of Mathematics, Qinghai Nationalities College, Xining, China
Open Journal of Discrete Mathematics·Volume 13 (2022)·Pages 16–26·Published 8 November 2022·DOI10.4236/ojdm.2023.131002
Copy link · social · email
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 l argest component of . In this paper, we determine the rupture degree of some Cartesian product graphs.
KeywordsThe Rupture DegreeCartesian ProductThe Vulnerability
- 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.
- 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
- Li, Y.K. (2006) An Algorithm for Computing the Rupture Degree of Tree. Computer Engineering and Applications, 42, 52-54.
- 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.
- Bondy, J.A. and Murty, U.S.R. (1976) Graph Theory with Applications. Macmillan, London; Elsevier, New York.