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...
| Główni autorzy: | , |
|---|---|
| Format: | Journal article |
| Język: | English |
| Wydane: |
Electronic Journal of Combinatorics
2022
|