Disjoint path covers in recursive circulants G(2ᵐ,4) with faulty elements

DOI10.1016/J.TCS.2011.04.045MaRDI QIDQ638530zbMATH OpenOpenAlexFDO

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

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

graph theoryembeddingfault 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)

Recommendations

• Computing and Combinatorics
• Algorithms and Computation
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs

Cites work

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

Cited in

(18)

• General-demand disjoint path covers in a graph with faulty elements
• Algorithms and Computation
• Algorithms for finding disjoint path covers in unit interval graphs
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Edge-fault tolerance of hypercube-like networks
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Ore-type degree conditions for disjoint path covers in simple graphs
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Paired many-to-many disjoint path covers of the hypercubes
• Disjoint path covers in cubes of connected graphs
• Single-source three-disjoint path covers in cubes of connected graphs
• Disjoint path covers joining prescribed source and sink sets in interval graphs
• The super spanning connectivity and super spanning laceability of tori with faulty elements
• One-to-one disjoint path covers in digraphs

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

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