全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
Mathematics  2012 

Spanning trees with many leaves: lower bounds in terms of number of vertices of degree 1, 3 and at least~4

DOI: 10.1007/s10958-014-1692-7

Full-Text   Cite this paper   Add to My Lib

Abstract:

We prove that every connected graph with $s$ vertices of degree~1 and 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${1\over 3}t +{1\over 4}s+{3\over 2}$ leaves. We present infinite series of graphs showing that our bound is tight.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133