The locally twisted cubes
From MaRDI portal
Publication:4653697
DOI10.1080/0020716042000301752zbMath1097.68522OpenAlexW1997748822MaRDI QIDQ4653697
Xiaofan Yang, Graham M. Megson, David J. Evans
Publication date: 7 March 2005
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020716042000301752
Related Items (91)
Construction independent spanning trees on locally twisted cubes in parallel ⋮ Locally exchanged twisted cubes: connectivity and super connectivity ⋮ Improving the diameters of completely independent spanning trees in locally twisted cubes ⋮ Panconnectivity of locally twisted cubes ⋮ How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? ⋮ Node-pancyclicity and edge-pancyclicity of hypercube variants ⋮ Fault-tolerant analysis of a class of networks ⋮ Symmetry parameters of various hypercube families ⋮ Constructing two completely independent spanning trees in hypercube-variant networks ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ One-to-one communication in twisted cubes under restricted connectivity ⋮ The \(g\)-good-neighbor conditional diagnosability of locally twisted cubes ⋮ \(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK ⋮ Embedding mutually edge-disjoint cycles into locally twisted cubes ⋮ Improving the panconnectedness property of locally twisted cubes ⋮ The \(g\)-good-neighbor diagnosability of locally twisted cubes ⋮ The crossing number of locally twisted cubes \(L T Q_n\) ⋮ Structure and Substructure Connectivity of Hypercube-Like Networks ⋮ Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements ⋮ Layout of embedding locally twisted cube into the extended theta mesh topology ⋮ DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph ⋮ Connectivity and constructive algorithms of disjoint paths in dragonfly networks ⋮ The generalized 4-connectivity of locally twisted cubes ⋮ The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model ⋮ Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity ⋮ Conditional diagnosability of component-composition graphs under the PMC model ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks ⋮ Optimal broadcasting for locally twisted cubes ⋮ The spined cube: a new hypercube variant with smaller diameter ⋮ A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout ⋮ \(\{2,3\}\)-restricted connectivity of locally twisted cubes ⋮ Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Optimal Embedding of Locally Twisted Cubes into Grids ⋮ Symmetric property and reliability of locally twisted cubes ⋮ Edge-fault-tolerant strong Menger edge connectivity on regular graphs ⋮ A fast fault-identification algorithm for bijective connection graphs using the PMC model ⋮ Edge-fault tolerance of hypercube-like networks ⋮ Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model ⋮ Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ Independent spanning trees on twisted cubes ⋮ A note on minimum linear arrangement for BC graphs ⋮ A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model ⋮ Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity ⋮ Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance ⋮ The generalized 3-connectivity of two kinds of regular networks ⋮ Reliability analysis of bijective connection networks in terms of the extra edge-connectivity ⋮ A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes ⋮ Characterizations of optimal component cuts of locally twisted cubes ⋮ A (4n − 9)/3 diagnosis algorithm for generalised cube networks ⋮ \(h\)-restricted connectivity of locally twisted cubes ⋮ Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity ⋮ Cycles embedding in folded hypercubes under the conditional fault model ⋮ The generalized measure of edge fault tolerance in exchanged crossed cube ⋮ The second eigenvalue of some normal Cayley graphs of highly transitive groups ⋮ Constructing independent spanning trees for locally twisted cubes ⋮ Hamiltonian properties of twisted hypercube-like networks with more faulty elements ⋮ A novel algorithm to embed a multi-dimensional torus into a locally twisted cube ⋮ Linear layout of locally twisted cubes ⋮ Fault-tolerant edge-pancyclicity of locally twisted cubes ⋮ Efficient unicast in bijective connection networks with the restricted faulty node set ⋮ Locally twisted cubes are 4-pancyclic. ⋮ An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges ⋮ Embedding a family of disjoint multi-dimensional meshes into a crossed cube ⋮ A note about some properties of BC graphs ⋮ Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions ⋮ Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Disjoint Hamilton cycles in the star graph ⋮ Fractional matching preclusion of the restricted HL-graphs ⋮ Embedding meshes into locally twisted cubes ⋮ A lower bound on the size of \(k\)-neighborhood in generalized cubes ⋮ The number of short cycles in Fibonacci cubes ⋮ Constructing edge-disjoint spanning trees in locally twisted cubes ⋮ Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes ⋮ A survey of graphs with known or bounded crossing numbers ⋮ Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks ⋮ Embedding a family of disjoint 3D meshes into a crossed cube ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Conditional edge connectivity of the locally twisted cubes ⋮ Survey on path and cycle embedding in some networks ⋮ Minimum neighborhood in a generalized cube ⋮ Optimizing Hamiltonian panconnectedness for the crossed cube architecture ⋮ Star graph automorphisms and disjoint Hamilton cycles ⋮ Changing the diameter of the locally twisted cube ⋮ Hybrid fault diagnosis capability analysis of triangle-free graphs ⋮ Fault tolerance of locally twisted cubes ⋮ Communication Performance Evaluation of the Locally Twisted Cube ⋮ Generalized matching networks and their properties
Cites Work
This page was built for publication: The locally twisted cubes
