Abstract: Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let G be a kG-connected graph and D_c(G) denote the diameter of G after deleting any of ...

Department of Mathematics and Statistics, Qinghai Nationalities University, Xining, China. We call a multiprocessor system fault-tolerant if it can keep working in case of failure. In the beginning, ...

In this paper, we focus on learning the underlying product graph structure from multidomain training data. We assume that the product graph is formed from a Cartesian graph product of two smaller ...

ABSTRACT: A proper edge t-coloring of a graph G is a coloring of its edges with colors 1,2,???,t such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval ...

// Define a structure to represent an element in the Cartesian product // Each element in the product is an ordered pair from both sets with a membership value ...