# zbMATH — the first resource for mathematics

Graphs with constant link and small degree or order. (English) Zbl 0582.05049
Given a graph G and a vertex $$v\in V(G)$$, the induced subgraph on the vertex adjacent to v is called the link of v. If each vertex has the same link L, then G is said to have constant link L. Several construction methods and non-existence results are presented. Two lists are given: (1) All graphs L of order $$\leq 6$$ which can serve as constant links. (2) All graphs G of order $$\leq 11$$ which have constant link.
Reviewer: J.Plesník

##### MSC:
 05C99 Graph theory 05C25 Graphs and abstract algebra (groups, rings, fields, etc.)