Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube

DOI10.1016/J.DAM.2023.04.025MaRDI QIDQ6162041zbMATH OpenFDO

Authors Pranava K. Jha

Publication date 15 June 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

zbMATH Keywords

hypercubeinterconnection networksgraph factorizationexchanged hypercubedual-cubevertex-induced subgraph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65)

Recommendations

• Efficient Embeddings into Hypercube-like Topologies
• Hypercube emulation of interconnection networks topologies
• Optimal embeddings of butterfly-like graphs in the hypercube
• Embedding of Grids into Optimal Hypercubes
• Embedding star networks into hypercubes

Cites work

• scientific article; zbMATH DE number 47528 (Why is no real title available?)
• 1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes
• Embedding Trees in a Hypercube is NP-Complete
• Graph factors and factorization: 1985--2003: a survey
• Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
• Handbook of product graphs
• Highly symmetric subgraphs of hypercubes
• Implicat Representation of Graphs
• Induced subgraphs of hypercubes
• Long path and cycle decompositions of even hypercubes
• NP-completeness of graph decomposition problems
• On Fault-Tolerant Low-Diameter Clusters in Graphs
• On the Complexity of General Graph Factor Problems
• On the decomposition of n‐cubes into isomorphic trees
• Planar 3DM is NP-complete
• Sensitivity vs. block sensitivity of Boolean functions
• Subgraph Isomorphism in Planar Graphs and Related Problems
• Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube
• The connectivity of exchanged hypercubes
• The upper and lower bounds of \(R_g\)-conditional diagnosability of networks

Cited in

(3)

• Optimal subcube embeddability in hypercubes with additional dimensions
• scientific article; zbMATH DE number 70115 (Why is no real title available?)
• Efficient proper embedding of a daisy cube

This page was built for publication: Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube

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