On the complexity of testing a graph for n-cube

DOI10.1016/0020-0190(80)90025-3zbMath0448.68016OpenAlexW2084394484MaRDI QIDQ1146982

Kabekode V. S. Bhat

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90025-3

zbMATH Keywords

efficient algorithmn-cube characterization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (6)

Recognizing Hamming graphs in linear time and space ⋮ Recognizing halved cubes in a constant time per edge ⋮ Fixed hypercube embedding ⋮ Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks ⋮ Hypercube embedding heuristics: An evaluation ⋮ A graph theoretic approach to switching function minimization

Cites Work

• Unnamed Item
• Unnamed Item
• \((0,\lambda)\)-graphs and \(n\)-cubes
• Strongly graceful graphs
• On cubical graphs
• Bounds on the number of Hamiltonian circuits in the n-cube
• A characterization of hypercubes
• Parallel concepts in graph theory
• Distance-preserving subgraphs of hypercubes
• n‐cubes and median graphs
• An Appraisal of Some Shortest-Path Algorithms
• On the Addressing Problem for Loop Switching

This page was built for publication: On the complexity of testing a graph for n-cube