Degrees in link graphs of regular graphs
We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $\mathcal{G}$ is d-regular and connected but not complete then some link graph of $\mathcal{G}$ has inimum degree at most $\mathcal{⌊2d...
Main Authors: | Benjamini, I, Haslegrave, J |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Electronic Journal of Combinatorics
2022
|
Similar Items
-
The number and average size of connected sets in graphs with degree constraints
by: Haslegrave, JGE
Published: (2022) -
Smallest Regular Graphs of Given Degree and Diameter
by: Knor Martin
Published: (2014-02-01) -
Existence of Regular Nut Graphs for Degree at Most 11
by: Fowler Patrick W., et al.
Published: (2020-05-01) -
Regular Colorings in Regular Graphs
by: Bernshteyn Anton, et al.
Published: (2020-08-01) -
GROWTH AND ISOPERIMETRIC PROFILE OF PLANAR GRAPHS
by: Benjamini, I, et al.
Published: (2011)