Decomposition of hypercubes into regular connected bipancyclic subgraphs

DOI10.1142/S1793830915500330zbMath1325.05134OpenAlexW1855242230MaRDI QIDQ3451073

Y. M. Borse, S. A. Kandekar

Publication date: 10 November 2015

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

hypercubespanning subgraphsbipancyclic\(n\)-connected

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items

Unnamed Item, Decomposition of the product of cycles based on degree partition, Decomposing hypercubes into regular connected subgraphs, Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks, Factorizations of the product of cycles, On 4-regular 4-connected bipancyclic subgraphs of hypercubes

Cites Work

• Unnamed Item
• Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees
• Decomposing the cube into paths
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Connectivity of Cartesian products of graphs
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Symmetric edge-decompositions of hypercubes
• Edge decompositions of hypercubes by paths and by cycles
• Regular connected bipancyclic spanning subgraphs of hypercubes
• Hamilton Decompositions and (n/2)-Factorizations of Hypercubes