CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)

DOI10.1142/S0129054110007143zbMath1213.05040OpenAlexW2128919165MaRDI QIDQ5187853

Jinn-Shyong Yang, Shyue-Ming Tang, Yue-Li Wang, Jou-Ming Chang

Publication date: 9 March 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054110007143

zbMATH Keywords

multiple independent spanning trees

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Construction independent spanning trees on locally twisted cubes in parallel ⋮ A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks ⋮ Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs ⋮ Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ Independent spanning trees on even networks ⋮ Broadcasting secure messages via optimal independent spanning trees in folded hypercubes

Cites Work

• Disjoint Hamiltonian cycles in recursive circulant graphs
• Independent spanning trees of chordal rings
• 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
• The multi-tree approach to reliability in distributed networks
• Multiplicative circulant networks. Topological properties and communication algorithms
• Reliable broadcasting in product networks
• 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
• Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• Finding Four Independent Trees
• Independent spanning trees with small depths in iterated line digraphs

This page was built for publication: CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)