Two-degree trees
Received date: 2021-05-07
Online published: 2023-03-23
乔璞 , 詹兴致 . 具有两个度数的树[J]. 华东师范大学学报(自然科学版), 2023 , 2023(2) : 1 -4 . DOI: 10.3969/j.issn.1000-5641.2023.02.001
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,
Key words: two-degree tree; diameter; unique graph
1 | BONDY J A, MURTY U S R. Graph Theory [M]. New York: Springer, 2008. |
2 | BLASS A, HARARY F, MILLER Z. Which trees are link graphs?. Journal of Combinatorial Theory (Series B), 1980, 29, 277- 292. |
3 | BROERSMA H, XIONG L, YOSHIMOTO K. Toughness and hamiltonicity in k-trees . Discrete Math, 2007, 307, 832- 838. |
/
〈 |
|
〉 |