One-to-one disjoint path covers on alternating group graphs

DOI10.1016/J.TCS.2014.09.041MaRDI QIDQ476856zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Lantao You, Jianxi Fan, Yuejuan Han, X.-H. Jia

Publication date 2 December 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2014.09.041

zbMATH Keywords

alternating group graphinterconnection networkone-to-one disjoint path coversparallel computing

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An algebraic approach for finding disjoint paths in the alternating group graph
• An algorithm for finding disjoint paths in the alternating group graph
• Two disjoint cycles of various lengths in alternating group graph
• A disjoint path problem in the alternating group graph
• The Nova Graph: more disjoint paths with minimal graph augmentation

Cites work

• A new class of interconnection networks based on the alternating group
• Conditional diagnosability of alternating group networks
• Efficient unicast in bijective connection networks with the restricted faulty node set
• Embedding meshes/tori in faulty crossed cubes
• Fault diagnosability of arrangement graphs
• Fault tolerance of edge pancyclicity in alternating group graphs
• Fault-tolerant cycle-embedding in alternating group graphs
• Fault-tolerant embedding of paths in crossed cubes
• Graph theory
• Hamiltonian properties of twisted hypercube-like networks with more faulty elements
• On Path Cover Problems in Digraphs and Applications to Program Testing
• One-to-one disjoint path covers on k-ary n-cubes
• Optimal broadcasting for locally twisted cubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Reliability Evaluation of BC Networks
• Some new topological properties of the triangular pyramid networks
• The spanning connectivity of folded hypercubes

Cited in

(17)

• Super spanning connectivity on WK-recursive networks
• Two disjoint cycles of various lengths in alternating group graph
• Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices
• Super spanning connectivity of split-star networks
• A well-equalized 3-CIST partition of alternating group graphs
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• A disjoint path problem in the alternating group graph
• An algorithm for finding disjoint paths in the alternating group graph
• An algebraic approach for finding disjoint paths in the alternating group graph
• Computing and Combinatorics
• One-to-one conditional path covers on augmented cubes
• The Nova Graph: more disjoint paths with minimal graph augmentation
• A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
• Limit profile for the transpose top-2 with random shuffle
• Super spanning connectivity of the generalized hypercube network
• An efficient algorithm to construct disjoint path covers of DCell networks
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs

This page was built for publication: One-to-one disjoint path covers on alternating group graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476856)