Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ejc.2008.09.008 | Eur. J. Comb. |
Keywords | DocType | Volume |
l1 graph,finite closed polyhexes,path distance isometrically embeds,connected graph,trivalent surface graph | Journal | 30 |
Issue | ISSN | Citations |
5 | 0195-6698 | 1 |
PageRank | References | Authors |
0.38 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Deza | 1 | 1 | 0.38 |
| S. Shpectorov | 2 | 82 | 15.28 |