华东师范大学学报（自然科学版）Issue(2)：1-4,4.DOI:10.3969/j.issn.1000-5641.2023.02.001
具有两个度数的树
Two-degree trees
摘要
Abstract
A graph is called a two-degree graph if its vertices have only two distinct degrees.A two-degree tree of order at least three have two degrees,1 and d for some d≥2;such a tree is called a(1,d)-tree.Given a positive integer n,we determine:(1)the possible values of d such that there exists a(1,d)-tree of order n;(2)the values of d such that there exists a unique(1,d)n-tree of order,and(3)the maximum diameter of two-degree trees of order n.The results provide a new example showing that the behavior of graphs may sometimes be determined by number theoretic properties.关键词
二度树/直径/唯一图Key words
two-degree tree/diameter/unique graph分类
数理科学引用本文复制引用
乔璞,詹兴致..具有两个度数的树[J].华东师范大学学报（自然科学版）,2023,(2):1-4,4.基金项目
国家自然科学基金(11671148,11771148) （11671148,11771148）
上海市科学技术委员会基金(18dz2271000) （18dz2271000）
