Results 221 to 230 of about 2,737 (252)
Some of the next articles are maybe not open access.

Linearly many faults in augmented cubes

International Journal of Parallel, Emergent and Distributed Systems, 2013
The augmented cube was introduced as a better interconnection network than the hypercube. An interconnection network needs to have good structural properties beyond simple measures such as connectivity. There are many different measures of structural integrity of interconnection networks.
László Lipták, Eddie Cheng
exaly   +2 more sources

Conditional edge-fault Hamiltonicity of augmented cubes☆

Information Sciences, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sun-Yuan Hsieh
exaly   +3 more sources

Constructing spanning trees in augmented cubes

Journal of Parallel and Distributed Computing, 2018
Abstract The spanning trees T 1 , T 2 , … , T k of G are edge-disjoint spanning trees (EDSTs) if they are pairwise edge-disjoint. In addition to it if they are pairwise internally vertex disjoint then they are called completely independent spanning trees (CISTs) in G .
Smruti Mane   +2 more
exaly   +2 more sources

Geodesic pancyclicity and balanced pancyclicity of Augmented cubes

Information Processing Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang-Hsiung Tsai, Pao-Lien Lai
exaly   +2 more sources

Augmented cubes

Networks, 2002
AbstractFollowing the recursive definition of the hypercube Qn, we define the augmented cube AQn. After showing that its graph is vertex‐symmetric, (2n − 1)‐regular, and (2n − 1)‐connected and that it has diameter ⌈n/2⌉, we describe optimal routing and broadcasting procedures.
Sheshayya A. Choudum, V. Sunitha
openaire   +1 more source

Automorphisms of augmented cubes

International Journal of Computer Mathematics, 2008
A variation of the hypercube, the augmented cube AQn of dimension n is defined as follows. It has 2n vertices, each labelled by an n-bit binary string a1 a2···an. Define AQ1=K2. For n≥2, AQn is obtained by taking two copies [image omitted]  and [image omitted]  of AQn-1, with vertex sets [image omitted] , [image omitted] , and joining 0 a2 a3···an with
Sheshayya A. Choudum, V. Sunitha
openaire   +1 more source

The panpositionable panconnectedness of augmented cubes

Information Sciences, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tzu-Liang Kung   +2 more
openaire   +1 more source

On the surface area of the augmented cubes

The Journal of Supercomputing, 2011
The surface area of a communication network centered at a certain vertex, i.e., the number of vertices at the same distance from this given vertex within such a network, provides an important measurement of the broadcasting and other intercommunication capabilities of this network and can find several other applications in network studies.
Eddie Cheng 0001   +2 more
openaire   +1 more source

A note on “The super connectivity of augmented cubes”

Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meijie Ma   +3 more
openaire   +2 more sources

On Edge-Fault Tolerance in Augmented Cubes

Journal of Interconnection Networks, 2020
The augmented cube AQn is one of the important variations of the hypercube Qn. In this paper, we prove that the conditional h-edge connectivity of AQn with n ≥ 3 is 8n − 16 for h = 3 and 2n for h = 2n − 3. We also obtain an upper bound on the conditional h-edge connectivity for odd integer h satisfying [Formula: see text].
Amita A. Shinde, Y. M. Borse
openaire   +1 more source

Home - About - Disclaimer - Privacy