Polyhexes that are ℓ1graphs

M Deza; Sergey Shpectorov

doi:10.1016/j.ejc.2008.09.008

Polyhexes that are ℓ1graphs

M Deza, Sergey Shpectorov

Mathematics

Research output: Contribution to journal › Article

5 Citations (Scopus)

Abstract

A connected graph is said to be l(1) if its path distance isometrically embeds into the space l(1). Following the work of Deza, Grishukhin, Shtogrin, and others on polyliedral l(1), graphs, we determine all finite closed polyhexes (trivalent surface graphs with hexagonal faces) that are l(1). (C) 2008 Elsevier Ltd. All rights reserved.

Original language	English
Pages (from-to)	1090-1100
Number of pages	11
Journal	European Journal of Combinatorics
Volume	30
Issue number	5
DOIs	https://doi.org/10.1016/j.ejc.2008.09.008
Publication status	Published - 1 Jul 2009

Access to Document

10.1016/j.ejc.2008.09.008

Cite this

@article{cc376481282445bda0cae20227603d17,

title = "Polyhexes that are ℓ1graphs",

abstract = "A connected graph is said to be l(1) if its path distance isometrically embeds into the space l(1). Following the work of Deza, Grishukhin, Shtogrin, and others on polyliedral l(1), graphs, we determine all finite closed polyhexes (trivalent surface graphs with hexagonal faces) that are l(1). (C) 2008 Elsevier Ltd. All rights reserved.",

author = "M Deza and Sergey Shpectorov",

year = "2009",

month = jul,

day = "1",

doi = "10.1016/j.ejc.2008.09.008",

language = "English",

volume = "30",

pages = "1090--1100",

journal = "European Journal of Combinatorics",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - Polyhexes that are ℓ1graphs

AU - Deza, M

AU - Shpectorov, Sergey

PY - 2009/7/1

Y1 - 2009/7/1

N2 - A connected graph is said to be l(1) if its path distance isometrically embeds into the space l(1). Following the work of Deza, Grishukhin, Shtogrin, and others on polyliedral l(1), graphs, we determine all finite closed polyhexes (trivalent surface graphs with hexagonal faces) that are l(1). (C) 2008 Elsevier Ltd. All rights reserved.

AB - A connected graph is said to be l(1) if its path distance isometrically embeds into the space l(1). Following the work of Deza, Grishukhin, Shtogrin, and others on polyliedral l(1), graphs, we determine all finite closed polyhexes (trivalent surface graphs with hexagonal faces) that are l(1). (C) 2008 Elsevier Ltd. All rights reserved.

U2 - 10.1016/j.ejc.2008.09.008

DO - 10.1016/j.ejc.2008.09.008

M3 - Article

VL - 30

SP - 1090

EP - 1100

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 5

ER -

Polyhexes that are ℓ1graphs

Abstract

Access to Document

Fingerprint

Cite this