Title of article
Polyhexes that are graphs
Author/Authors
Deza، نويسنده , , M. and Shpectorov، نويسنده , , S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
11
From page
1090
To page
1100
Abstract
A connected graph is said to be ℓ 1 if its path distance isometrically embeds into the space ℓ 1 . Following the work of Deza, Grishukhin, Shtogrin, and others on polyhedral ℓ 1 graphs, we determine all finite closed polyhexes (trivalent surface graphs with hexagonal faces) that are ℓ 1 .
Journal title
European Journal of Combinatorics
Serial Year
2009
Journal title
European Journal of Combinatorics
Record number
1548965
Link To Document