The 3*-connected property of pyramid networks
A k-container C(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, of G is a k*-container if it contains all the vertices of G. A graph G is k*-connected if there exists a k*-container between any two distinct vertices in G. Let K(G) be the connectivity of G. A graph G is superconnected if G is i*-connected for all 1  = 1. (C) 2010 Elsevier Ltd. All rights reserved.
connectivity pyramid networks hamiltonian