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

DOI10.1016/j.tcs.2014.09.041zbMath1303.68097OpenAlexW1999526736WikidataQ60402187 ScholiaQ60402187MaRDI QIDQ476856

Yuejuan Han, Jianxi Fan, Lantao You, Xiao-Hua 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

parallel computinginterconnection networkalternating group graphone-to-one disjoint path covers

Mathematics Subject Classification ID

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

Related Items (9)

Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Two disjoint cycles of various lengths in alternating group graph ⋮ A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs ⋮ An efficient algorithm to construct disjoint path covers of DCell networks ⋮ Super spanning connectivity on WK-recursive networks ⋮ Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Super spanning connectivity of split-star networks ⋮ Unnamed Item

Cites Work

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

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