Article citationsMore>>

El-Mesady, A., Bazighifan, O. and Al-Mdallal, Q. (2022) On Infinite Circulant-Balanced Complete Multipartite Graphs Decompositions Based on Generalized Algorithmic Approaches. Alexandria Engineering Journal, 61, 11267-11275.
https://doi.org/10.1016/j.aej.2022.04.022

has been cited by the following article:

• TITLE: The g-Good-Neighbor Connectivity of Some Cartesian Product Graphs

  AUTHORS: Yinkui Li, Ting Xie, Xiaoxiao Qin

  KEYWORDS: Connectivity, The g-Good-Neighbor Connectivity, Cartesian Product

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.13 No.1, January 12, 2023

  ABSTRACT: The g-good-neighbor connectivity of G is a generalization of the concept of connectivity, which is just for, and an important parameter in measuring the fault tolerance and reliability of interconnection network. Many well-known networks can be constructed by the Cartesian products of some simple graphs. In this paper, we determine the g-good-neighbor connectivity of some Cartesian product graphs. We give the exact value of g-good-neighbor connectivity of the Cartesian product of two complete graphs and for , mesh for , cylindrical grid and torus for .