Journal
DISCRETE MATHEMATICS
Volume 344, Issue 11, Pages -Publisher
ELSEVIER
DOI: 10.1016/j.disc.2021.112548
Keywords
Diameter; Minimum diameter spanning tree; Minimum degree
Categories
Funding
- JSPS KAKENHI [JP18K13449]
Ask authors/readers for more resources
In this paper, it is proven that for a sufficiently large integer d and a connected graph G, if the number of vertices in G is less than (d+2)(delta(G)+1)/3, then there exists a spanning tree T of G such that the diameter of T is at most d.
In this paper, we prove that for a sufficiently large integer d and a connected graph G, if vertical bar V (G)vertical bar < (d+2)(delta(G)+1)/3, then there exists a spanning tree T of G such that diam(T) <= d. (C) 2021 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
