Rank numbers for graphs with paths and cycles

Show full item record

Title: Rank numbers for graphs with paths and cycles
Author: McClive, Jacqueline
Abstract: A coloring of a graph, G, is an assignment of positive integers to the vertices of the graph with one number assigned to each vertex, so that adjacent vertices are assigned different numbers. A k-ranking of a graph is a coloring that uses {1, 2, ..., k} with the requirement that every path between any two vertices labeled with the same number contains a vertex with a higher label. The rank number of a graph, denoted [chi]r(G), is the smallest k such that G has a k-ranking. In this paper we seek rank numbers for four specific families of graphs. Each of these families of graphs contains at least one cycle as a subgraph.
Record URI: http://hdl.handle.net/1850/13411
Date: 2010-05-18

Files in this item

Files Size Format View
JMcCliveThesis5-18-2010.pdf 1.892Mb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse