"A Bound on the Number of Leaves in a Spanning Tree of a Connected Graph of Minimum Degree 6"

LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

We prove that a connected graph of minimum degree 6 has a spanning tree such that at least 1121$$ \frac{11\ }{21} $$ of its vertices are leaves. Click to show full abstract

We prove that a connected graph of minimum degree 6 has a spanning tree such that at least 1121$$ \frac{11\ }{21} $$ of its vertices are leaves.

Keywords: bound number; graph minimum; connected graph; minimum degree; spanning tree

Journal Title: Journal of Mathematical Sciences
Year Published: 2018

Link to full text (if available)

Share on Social Media: Sign Up to like & get
recommendations!
1

LAUSR

You are not signed in:

Sign Up!

Related content

More Information News Social Media Video Recommended