Accretion centers: A generalization of branch weight centroids
Accretion centers: A generalization of branch weight centroids
复制标题
吸积中心：分支权重质心的推广
DOI：
10.1016/0166-218x(81)90015-9
复制
发表时间：
1981
影响因子：
1.1
通讯作者：
P. Slater
中科院分区：
文献类型：
--
作者：
P. Slater
An orderedn-tuple (vi1,vi2,…,vin) is called asequential labellingof graphGif {vi1,vi2,…,vin} =V(G) and the subgraph induced by {vi1,vi2,…,vij} is connected for 1≤j≤n. Letσ(v;G) denote the number of sequential labellings ofGwithvi1=v. Vertexvis defined to be anaccretion centerofGif σ is maximized atv. This is shown to generalize the concept of a branch weight centroid of a tree since a vertex in a tree is an accretion center if and only if it is a centroid vertex. It is not, however, a generalization of the concept of a median since for a general graph an accretion center is not necessarily a vertex of minimum distance. A method for computingσ(v;G) based upon edge contractions is described.
