Rank numbers for some trees and unicyclic graphs
Rank numbers for some trees and unicyclic graphs
复制标题
一些树和单环图的排名数
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
D. Narayan
中科院分区：
文献类型：
--
作者：
Emily Sergel;P. Richter;Anh Tran;Patrick Curran;Jobby Jacob;D. Narayan
一个图的排序是一个正整数的分配给它的顶点，使得任何两个顶点之间的路径相同的秩包含一个顶点的严格更大的秩。图的秩数是可以在排序中使用的标签的最少数量。本文确定了一些树和单圈图的秩数。
A ranking on a graph is an assignment of positive integers to its vertices such that any path between two vertices of the same rank contains a vertex of strictly larger rank. The rank number of a graph is the fewest number of labels that can be used in a ranking. In this paper we determine rank numbers for some trees and unicyclic graphs.