๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graphs with constant link and small degree or order

โœ Scribed by J. I. Hall

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
957 KB
Volume
9
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

โœฆ Synopsis

The graph G has constant link L if for each vertex x of. G the graph induced by G on the, vertices adjacent to x is isomorphic to L. For each graph L on 6 or fewer vertices w e decide whether or not there exists a graph G with constant link L. From this w e are able to list all graphs on 11 or fewer vertices which have constant link.

๐Ÿ“œ SIMILAR VOLUMES

Graphs with given group and given consta
Graphs with given group and given constant link
โœ Walter Vogler ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 228 KB

## Abstract __A__ graph __L__ is called a link graph if there is a graph __G__ such that for each vertex of __G__ its neighbors induce a subgraph isomorphic to __L.__ Such a G is said to have constant link __.__L Sabidussi proved that for any finite group F and any __n__ โฉพ 3 there are infinitely ma

Representing groups by graphs with const
Representing groups by graphs with constant link and hypergraphs
โœ Walter Vogler ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 772 KB

A graph L is called a link graph if there is a graph G such that for each vertex of G its neighbors induce a subgraph isomorphic to L. Such a G is said to have constant link L. We prove that for any finite group r and any disconnected link graph L with at least three vertices there are infinitely ma

Connected subgraphs with small degree su
Connected subgraphs with small degree sums in 3-connected planar graphs
โœ Enomoto, Hikoe; Ota, Katsuhiro ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 213 KB ๐Ÿ‘ 2 views

It is well-known that every planar graph has a vertex of degree at most five. Kotzig proved that every 3-connected planar graph has an edge xy such that deg(x) + deg(y) โ‰ค 13. In this article, considering a similar problem for the case of three or more vertices that induce a connected subgraph, we sh