Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2ᵐ,4)

DOI10.1016/J.TCS.2007.10.016zbMATH Open1134.68044OpenAlexW2064966517MaRDI QIDQ2474073FDOQ2474073

Authors: Jung-Heum Park 

Publication date: 5 March 2008

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

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

Recommendations

• Edge-pancyclicity of recursive circulants
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• Pancyclicity of connected circulant graphs
• Erratum to ``Pancyclicity of recursive circulant graphs
• Pancyclicity of recursive circulant graphs
• Edge‐fault‐tolerant pancyclicity of alternating group graphs
• Edge-fault-tolerant pancyclicity of arrangement graphs
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes

zbMATH Keywords

embeddingfault toleranceinterconnection networksringsedge-pancyclicpanconnectedlinear arraysrecursive circulants

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Fault-tolerant cycle-embedding of crossed cubes
• Panconnectivity of locally twisted cubes
• On embedding cycles into faulty twisted cubes
• Algorithms and Computation
• Edge-pancyclicity of recursive circulants
• Recursive circulants and their embeddings among hypercubes
• Hamiltonian decomposition of recursive circulant graphs
• On ring embedding in hypercubes with faulty nodes and links
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Title not available (Why is that?)
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Pancyclicity of recursive circulant graphs
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Embedding trees in recursive circulants
• Title not available (Why is that?)

Cited In (18)

• Vulnerability of super edge-connected networks
• Edge-fault-tolerant vertex-pancyclicity of augmented cubes
• Vertex-pancyclicity of augmented cubes with maximal faulty edges
• Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes
• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
• Cluster fault-tolerant routing in pancake graphs
• Cycles passing through a prescribed path in a hypercube with faulty edges
• Edge-pancyclicity of recursive circulants
• Maximum incomplete recursive circulants in graph embeddings
• Fault-tolerant embedding of paths in crossed cubes
• Panconnectivity and edge-pancyclicity of multidimensional torus networks
• Vertex-bipancyclicity of the generalized honeycomb tori
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• Vertex-pancyclicity of twisted cubes with maximal faulty edges
• Improved precise fault diagnosis algorithm for hypercube-like graphs

This page was built for publication: Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)

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