Maximum induced subgraph of a recursive circulant

DOI10.1016/j.ipl.2005.03.004zbMath1182.68012OpenAlexW2060538383MaRDI QIDQ1041770

Xiaofan Yang, Graham M. Megson, David J. Evans

Publication date: 4 December 2009

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

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

zbMATH Keywords

interconnection networksinduced subgraphbisection widthrecursive circulant

Mathematics Subject Classification ID

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

Related Items (9)

Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables ⋮ Sets of binary sequences with small total Hamming distances ⋮ THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK ⋮ On linear layout of bicube and construction of optimal incomplete bicube ⋮ Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2) ⋮ A lower bound on the size of \(k\)-neighborhood in generalized cubes ⋮ On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) ⋮ Minimum neighborhood in a generalized cube

Cites Work

• Disjoint Hamiltonian cycles in recursive circulant graphs
• Maximum number of edges joining vertices on a cube
• Edge-pancyclicity of recursive circulants
• Parallel concepts in graph theory
• Multiplicative circulant networks. Topological properties and communication algorithms
• Recursive circulants and their embeddings among hypercubes
• Pancyclicity of recursive circulant graphs
• Erratum to ``Pancyclicity of recursive circulant graphs
• Embedding trees in recursive circulants
• Hamiltonian decomposition of recursive circulant graphs

This page was built for publication: Maximum induced subgraph of a recursive circulant