Polyhexes that are \(\ell _1\) graphs (Q1024308): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 23:03, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polyhexes that are \(\ell _1\) graphs |
scientific article |
Statements
Polyhexes that are \(\ell _1\) graphs (English)
0 references
17 June 2009
0 references
A graph \(\Gamma\) is an \(\ell_1\) graph if the vertices of \(\Gamma\) can be matched with some points of \(\ell_1\) in such a way that the path distance between every two vertices of \(\Gamma\) is equal to the distance between the corresponding two points of \(\ell_1\). A polyhex is a finite trivalent surface graph \(\Gamma\) drawn on a surface \(S\) in such a way that every face is a hexagon. The authors determine all polyhexes that are \(\ell_1\) as follows: If \(\Gamma\) is an \(\ell_1\) polyhex then either \(\Gamma\) is the so-called prism polyhex \(\Gamma_{2n}\), \(n\geq 3\), or one of the four sporadic examples.
0 references
\(\ell_1\) graph
0 references
polyhex
0 references
metric graph
0 references