A finite graph which is locally a dodecahedron

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We give the first example of a finite graph all of whose neighbourhoods of vertices are isomorphic to a dodecahedron. © 1985.

Cite

CITATION STYLE

APA

Vanden Cruyce, P. (1985). A finite graph which is locally a dodecahedron. Discrete Mathematics, 54(3), 343–346. https://doi.org/10.1016/0012-365X(85)90119-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free