Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements

DOI10.1016/j.tcs.2011.04.045zbMath1223.68083OpenAlexW1509386669MaRDI QIDQ638530

Jae-Ha Lee, Jung-Heum Park, Sook-Yeon Kim

Publication date: 12 September 2011

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

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

zbMATH Keywords

embeddinggraph theoryfault toleranceinterconnection networksdisjoint pathsfault-hamiltonicitylinear arrays

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (15)

Algorithms for finding disjoint path covers in unit interval graphs ⋮ Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Disjoint path covers joining prescribed source and sink sets in interval graphs ⋮ Ore-type degree conditions for disjoint path covers in simple graphs ⋮ One-to-one disjoint path covers in digraphs ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Single-source three-disjoint path covers in cubes of connected graphs ⋮ Edge-fault tolerance of hypercube-like networks ⋮ Paired many-to-many disjoint path covers of the hypercubes ⋮ Disjoint path covers in cubes of connected graphs ⋮ THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjoint Hamiltonian cycles in recursive circulant graphs
• Many-to-many disjoint paths in faulty hypercubes
• The super laceability of the hypercubes
• The two-equal-disjoint path cover problem of matching composition network
• Path partitions of hypercubes
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• Edge-pancyclicity of recursive circulants
• Maximum induced subgraph of a recursive circulant
• Recursive circulants and their embeddings among hypercubes
• Pancyclicity of recursive circulant graphs
• Embedding trees in recursive circulants
• Hamiltonian decomposition of recursive circulant graphs
• The super-connected property of recursive circulant graphs
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• Minimum chromaticity of circulant graphs
• Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Computing and Combinatorics
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements

This page was built for publication: Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements