A condition ensuring that a connected graph has a spanning tree with few leaves

A condition ensuring that a connected graph has a spanning tree with few leaves

Let G be a connected graph. An independent set S with k vertices of G is a k - frame if G - S is connected. We establish a sufficient condition on 4-frames ensuring that the graph G has a spanning tree with a bounded number of leaves.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of mathematics 2023-06, Vol.9 (2), Article 26
1. Verfasser: Hanh, Dang Dinh
Format: Artikel
Sprache:eng
Schlagworte:
Algebraic Geometry
Apexes
Graph theory
Mathematics
Mathematics and Statistics
Research Article
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Let G be a connected graph. An independent set S with k vertices of G is a k - frame if G - S is connected. We establish a sufficient condition on 4-frames ensuring that the graph G has a spanning tree with a bounded number of leaves.
ISSN:2199-675X
2199-6768
DOI:10.1007/s40879-023-00624-1