Publisher： Academic Press
ISSN： 0195-6698
Source： European Journal of Combinatorics, Vol.17, Iss.2, 1996-02, pp. : 157-160
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this note we study scale embeddings of graphs into hypercubes. Let G =( V, E) be a graph and d G the usual path metric of G . By a hypercube we mean the edge graph H q of the q -dimensional binary cube. The path metric d H of H q is simply the Hamming distance.
Related content
On the undecidability of finite planar graphs
The Journal of Symbolic Logic, Vol. 36, Iss. 1, 1971-03 ,pp. :
Access to resources
Recommend
Reducible chains of planar 1-cycle resonant graphs
Discrete Mathematics, Vol. 275, Iss. 1, 2004-01 ,pp. :
On the undecidability of finite planar cubic graphs
The Journal of Symbolic Logic, Vol. 37, Iss. 3, 1972-09 ,pp. :
A note on 1-factors of point determining graphs
Bulletin of the Australian Mathematical Society, Vol. 25, Iss. 2, 1982-04 ,pp. :