Graphs with constant link and small degree or order.

*(English)*Zbl 0582.05049Given 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

Full Text:
DOI

##### References:

[1] | Blass, J. Combinatorid Theory 29 pp 277– (1980) |

[2] | and , On graphs with constant link. In NPW Directions in the Theory of Gruphs Ed., Academic, New York (1973) 19–51. |

[3] | Buekenhout, J. Alg. 45 pp 391– (1977) |

[4] | and , Finite graphs with isomorphic neighborhoods. In Proc. Colloq. Int. CNRS Orsay (1976). |

[5] | Hall, J. Graph Theory 4 pp 173– (1980) |

[6] | Hall, Geometriae Dedicata |

[7] | Graph Theory. Addison-Wesley, Reading, MA (1969). |

[8] | Graphs with given neighborhoods, I. In Proc. Colioy. Int., CNRS, Orsay (1976) 219–223. |

[9] | McKay, Math. Comp. 33 pp 1101– (1979) |

[10] | Ronan, Q. J. Mirth Oxford 32 pp 225– (1981) |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.