Summary: 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.