Reducing the maximum degree of a graph: comparisons of bounds
Let $\lambda(G)$ be the smallest number of vertices that can be removed from a non-empty graph $G$ so that the resulting graph has a smaller maximum degree. Let $\lambda_{\rm e}(G)$ be the smallest number of edges that can be removed from $G$ for the same purpose. Let $k$ be the maximum degree of $G...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2021-04-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol8/iss1/6 |