Panconnectivity of Cartesian product graphs.pdfVIP

J Supercomput DOI 10.1007/s11227-009-0356-8 Panconnectivity of Cartesian product graphs You Lu · Jun-Ming Xu © Springer Science+Business Media, LLC 2009 Abstract A graph G of order n (≥2) is said to be panconnected if for each pair (x, y) of vertices of G there exists an xy -path of length for each such that dG (x, y) ≤ ≤ n − 1, where dG (x, y) denotes the length of a shortest xy -path in G. In this paper, we consider the panconnectivity of Cartesian product graphs. As a consequence of our results, we prove that the n-dimensional generalized hypercube Q (k , k , . . . , k ) is n 1 2 n panconnected if and only if ki ≥ 3 (i = 1, . . . , n), which generalizes a result of Hsieh 3 et al. that the 3-ary n-cube Q is panconnected. n Keywords Graph theory · Interconnection networks · Panconnectivity · Cartesian product · Hypercubes · k-ary n-cubes 1 Introduction We follow [21, 22] for graph-theoretical terminology and notation not defined here. Let G = (V (G), E(G)) be a simple graph with vertex set V (G) and edge set E(G). The open neighborhood of a vertex v ∈ V (G), denoted by NG (v), is the set of neigh- bors of v, and the degree of v is dG (v) = |NG (v)|. The minimum degree of G is δ(G) = min{dG (v) : v ∈ V (G)}. For any u, v ∈ V (G), the distance dG (u, v) between vertices u and v is the length of a shortest uv-path in G. And the diameter of G is d(G) = max{dG (u, v) : u, v ∈ V (G)}. A graph G of order n (≥2) is said to be panconnected if for each pair (x, y) of vertices of G there exists an xy -path of length for each such that dG (x, y) ≤ ≤ n − 1 in G. A graph is of panconnectivity if it is panconnected. Note that any path of length at least three is not of panconnectivity. Y. Lu · J.-M. Xu ( ) Department of Mathematics, University