The super-connected property of recursive circulant graphs

DOI10.1016/J.IPL.2004.05.013zbMATH Open1177.68031OpenAlexW2029668828MaRDI QIDQ2390328FDOQ2390328

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

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

Cites Work

• Title not available (Why is that?)
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• Recursive circulants and their embeddings among hypercubes
• Disjoint Hamiltonian cycles in recursive circulant graphs
• On \(3^*\)-connected graphs
• Embedding trees in recursive circulants

Cited In (20)

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

   Recommendations

• The Super Spanning Connectivity of Arrangement Graphs 👍 👎
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS 👍 👎
• Super-connectivity and super-edge-connectivity for some interconnection networks 👍 👎
• Superconnected circulant digraphs 👍 👎
• The super connectivity of the pancake graphs and the super laceability of the star graphs 👍 👎

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

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