Spanning Trees with At Most 6 Leaves in K1,5-Free Graphs
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-11, 11 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2019-10-03
Country of Publication
Egypt
No. of Pages
11
Main Subjects
Abstract EN
A graph G is called K1,5-free if G contains no K1,5 as an induced subgraph.
A tree with at most m leaves is called an m-ended tree.
Let σkG be the minimum degree sum of k independent vertices in G.
In this paper, it is shown that every connected K1,5-free graph G contains a spanning 6-ended tree if σ7G≥G−2.
American Psychological Association (APA)
Sun, Pei& Liu, Kai. 2019. Spanning Trees with At Most 6 Leaves in K1,5-Free Graphs. Mathematical Problems in Engineering،Vol. 2019, no. 2019, pp.1-11.
https://search.emarefa.net/detail/BIM-1194298
Modern Language Association (MLA)
Sun, Pei& Liu, Kai. Spanning Trees with At Most 6 Leaves in K1,5-Free Graphs. Mathematical Problems in Engineering No. 2019 (2019), pp.1-11.
https://search.emarefa.net/detail/BIM-1194298
American Medical Association (AMA)
Sun, Pei& Liu, Kai. Spanning Trees with At Most 6 Leaves in K1,5-Free Graphs. Mathematical Problems in Engineering. 2019. Vol. 2019, no. 2019, pp.1-11.
https://search.emarefa.net/detail/BIM-1194298
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1194298
