.png){kind=icon}
.png){kind=icon}
Return
Which numbers are status differences?
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2021.126004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Given a connected graph G, the status S-G(x) of a vertex x of G is the sum of the distances from x to all other vertices in G, and the status difference of G is sd(G) = max(x,y is an element of)(V(G)) (S-G(x) - S-G(y)). The status difference is a useful descriptor in communication networks. We determine the numbers that can be the status differences of trees and connected graphs, respectively, with fixed order, and characterize the trees with the first a few smallest status differences when the order is fixed. Also, we identify the trees with maximum status difference over all trees with fixed maximum degree, number of leaves, and diameter, respectively, as well as the series-reduced trees with maximum status difference. (C) 2021 Elsevier Inc. All rights reserved.
Keywords:
Status difference
Minimum status
Maximum status
Number of leaves
Diameter
Series-reduced tree
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W