Egalitarian Edge Orderings of Complete Graphs
Egalitarian Edge Orderings of Complete Graphs
复制标题
DOI：
10.1007/s00373-021-02326-5
复制
发表时间：
2021-04
影响因子：
0.7
通讯作者：
C. Colbourn
中科院分区：
文献类型：
--
作者：
C. Colbourn
对于图的边的连续排序，顶点的点和是与该顶点关联的边的指数之和。出于在流行度排名的存在下平衡数据放置中的访问的问题，当所有点总和相等时，边缘排序是平等的，并且当两个点总和相差最多1时几乎是平等的。本文证明了n个顶点的完全图在和时允许平均边序，或在和时几乎允许平均边序。
For a consecutive ordering of the edges of a graph, the point sum of a vertex is the sum of the indices of edges incident with that vertex. Motivated by questions of balancing accesses in data placements in the presence of popularity rankings, an edge ordering is egalitarian when all point sums are equal, and almost egalitarian when two point sums differ by at most 1. It is established herein that complete graphs onnvertices admit an egalitarian edge ordering whenand, or an almost egalitarian edge ordering whenand.