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.

Library of Congress Subject Headings

Paths and cycles (Graph theory); Graph theory--Data processing; Graph coloring

Publication Date

5-18-2010

Document Type

Thesis

Department, Program, or Center

School of Mathematical Sciences (COS)

Advisor

Narayan, Darren

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA166.22 .M33 2010

Campus

RIT – Main Campus

Download

Share

COinS