Abstract
The n -dimensional hypercube is the graph with 2 n nodes labelled 0,1,…,2 n −1 and an edge joining two nodes whenever their binary representation differs in a single coordinate. The problem of deciding whether a given graph is a subgraph of an n -dimensional cube has recently been shown to be NP-complete. In this paper we illustrate a reduction technique used to obtain NP-completeness results for a variety of hypercube related graphs. We consider the subgraph isomorphism problem on two related families of graphs, the dilation two hypercubes and generalized hypercubes. We show that the embedding problem for both of these families is NP-complete.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
