| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650175 | Discrete Mathematics | 2009 | 6 Pages |
Abstract
Let f(t,k)f(t,k) be the maximum diameter of graphs obtained by deleting tt edges from a (t+1)(t+1)-edge-connected graph with diameter kk. This paper shows 42t−6
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
He-Xi Ye, Chao Yang, Jun-Ming Xu,