The super-connected property of recursive circulant graphs

DOI10.1016/j.ipl.2004.05.013zbMath1177.68031OpenAlexW2029668828MaRDI QIDQ2390328

Lih-Hsing Hsu, Jimmy J. M. Tan, Chang-Hsiung Tsai

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.05.013

zbMATH Keywords

containerinterconnection networkssuper-connectedrecursive circulant

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (19)

Hamiltonian decomposition of generalized recursive circulant graphs ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ On the spanning connectivity of tournaments ⋮ Spanning 3-connected index of graphs ⋮ Super spanning connectivity of split-star networks ⋮ The Super Spanning Connectivity of Arrangement Graphs ⋮ THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS ⋮ General-demand disjoint path covers in a graph with faulty elements ⋮ CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2) ⋮ Maximum incomplete recursive circulants in graph embeddings ⋮ The spanning connectivity of folded hypercubes ⋮ On the spanning connectivity and spanning laceability of hypercube-like networks ⋮ Super edge-connectivity of mixed Cayley graph ⋮ Embedding of recursive circulants into certain necklace graphs ⋮ On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) ⋮ On the spanning fan-connectivity of graphs ⋮ Unnamed Item ⋮ One-to-one disjoint path covers on multi-dimensional tori

Cites Work

• Disjoint Hamiltonian cycles in recursive circulant graphs
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• Recursive circulants and their embeddings among hypercubes
• Embedding trees in recursive circulants
• Unnamed Item
• Unnamed Item

This page was built for publication: The super-connected property of recursive circulant graphs