Rank numbers for some trees and unicyclic graphs
- 61 Downloads
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.
KeywordsPrimary 05C78 Secondary 05C15
Unable to display preview. Download preview PDF.
- 5.Dereniowski, D.: Rank coloring of graphs. In: Kubale, M. (ed.) Graph colorings, contemporary mathematics 352, AMS, Providence, pp. 79–93 (2004)Google Scholar
- 11.Leiserson, C.E.: Area efficient graph layouts for VLSI. In: Proceedings of the 21st annual IEEE symposium, FOCS, 1980, pp. 270–281Google Scholar