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...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 .展开更多
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...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.展开更多
文摘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 .
文摘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.
