摘要
The status of a vertex x in a graph is the sum of the distances between x and all other vertices. The status sequence of a graph is the list of the statuses of all vertices arranged in nondecreasing order. It is well known that non-isomorphic trees may have the same status sequence. We show that a tree is uniquely determined by its status sequence if the only pairs of vertices that have the same status are endvertices.
原文 | 英語 |
---|---|
頁(從 - 到) | 133-143 |
頁數 | 11 |
期刊 | Ars Combinatoria |
卷 | 139 |
出版狀態 | 已發佈 - 2018 7月 |
ASJC Scopus subject areas
- 一般數學