Reducing the maximum degree of a graph by deleting vertices: the extremal cases
Let $\lambda(G)$ denote 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. In a recent paper, we proved that if $n$ is the number of vertices of $G$, $k$ is the maximum degree of $G$, and $t$ is the number of verti...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2018-10-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol5/iss2/5 |