On the largest matching roots of graphs with a given number of pendent vertices

Discrete Applied Mathematics(2019)

引用 1|浏览6
暂无评分
摘要
In this note, we study the bounds of the largest matching roots of graphs with 0,1,2,3,4,n−2, and n−1 pendent vertices. We also determine the extremal graphs with respect to these bounds.
更多
查看译文
关键词
05C50
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要