Degree sums and spanning brooms of a graph
Y Wu, Y Zhang, Y Chen - Discrete Mathematics, 2022 - Elsevier
Y Wu, Y Zhang, Y Chen
Discrete Mathematics, 2022•ElsevierA broom is a tree obtained by identifying an endpoint of a path with the center of a star. Let G
be a connected graph of order n≥ 3. Chen et al.[2] conjectured that if the degree sum is at
least n− 2 for any three pairwise nonadjacent vertices, then G contains a spanning broom. In
this paper, we confirm the conjecture for n> 50.
be a connected graph of order n≥ 3. Chen et al.[2] conjectured that if the degree sum is at
least n− 2 for any three pairwise nonadjacent vertices, then G contains a spanning broom. In
this paper, we confirm the conjecture for n> 50.
A broom is a tree obtained by identifying an endpoint of a path with the center of a star. Let G be a connected graph of order n≥ 3. Chen et al.[2] conjectured that if the degree sum is at least n− 2 for any three pairwise nonadjacent vertices, then G contains a spanning broom. In this paper, we confirm the conjecture for n> 50.
Elsevier
Showing the best result for this search. See all results