منابع مشابه
The super connectivity of augmented cubes
The augmented cube AQn, proposed by Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2) (2002) 71–84], is a (2n− 1)-regular (2n− 1)-connected graph (n = 3). This paper determines that the super connectivity of AQn is 4n− 8 for n 6 and the super edge-connectivity is 4n− 4 for n 5. That is, for n 6 (respectively, n 5), at least 4n− 8 vertices (respectively, 4n− 4 edges...
متن کاملThe Super Spanning Connectivity of the Augmented Cubes
A k-container C(u, v) of G between u and v is a set of k internally disjoint paths between u and v. A k-container C(u, v) of G is a k∗-container if it contains all nodes of G. A graph G is k∗connected if there exists a k∗-container between any two distinct nodes. The spanning connectivity of G, κ∗(G), is defined to be the largest integer k such that G is w∗-connected for all 1 ≤ w ≤ k if G is a...
متن کاملA note on "The super connectivity of augmented cubes"
Article history: Received 8 June 2008 Received in revised form 13 January 2009 Available online 14 February 2009 Communicated by A.A. Bertossi
متن کاملThe super connectivity of shuffle-cubes
The shuffle-cube SQn, where n ≡ 2 (mod 4), a new variation of hypercubes proposed by Li et al. [T.-K. Li, J.J.M. Tan, L.-H. Hsu, T.-Y. Sung, The shuffle-cubes and their generalization, Inform. Process. Lett. 77 (2001) 35–41], is an n-regular n-connected graph. This paper determines that the super connectivity of SQn is 2n − 4 and the super edge-connectivity is 2n− 2 for n 6. 2005 Elsevier B.V...
متن کاملMaximally Local Connectivity on Augmented Cubes
Connectivity is an important measurement for the fault tolerance in interconnection networks. It is known that the augmented cube AQn is maximally connected, i.e. (2n − 1)-connected, for n ≥ 4. By the classical Menger’s Theorem, every pair of vertices in AQn is connected by 2n − 1 vertex-disjoint paths for n ≥ 4. A routing with parallel paths can speed up transfers of large amounts of data and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2008
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2007.10.005