1. -embeddability under the edge-gluing operation on graphs.
- Author
-
Wang, Guangfu and Zhang, Heping
- Subjects
- *
EMBEDDINGS (Mathematics) , *GRAPH theory , *BINARY number system , *VECTORS (Calculus) , *HAMMING distance , *BIPARTITE graphs - Abstract
Abstract: A graph is an -graph if its vertices can be labeled by binary vectors in such a way that the Hamming distance between the binary addresses is, up to scale, the distance in the graph between the corresponding vertices. In this note, we study when the result of gluing two -graphs along an edge is an -graph. If at least one of the constituent graphs is bipartite, then the resulting graph is also an -graph. For two nonbipartite -graphs, this is not always the case. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF