Odd Prime Graph Labelings

Holly Carter

Austin Peay State University

Bradley Fox

Austin Peay State University


Abstract

An odd prime labeling is a variation of a prime labeling in which the vertices of a graph of order n are labeled with the distinct odd integers 1 to 2n − 1 so that the labels of adjacent vertices are relatively prime. This paper investigates many different classes of graphs including disjoint unions of cycles, stacked prisms, and particular types of caterpillars, by using various methods to construct odd prime labelings. We also demonstrate progress toward proving a conjecture that all prime graphs have an odd prime labeling.


Author Biography

Bradley Fox, Austin Peay State University

Dr. Fox is an Associate Professor of Mathematics whose area of specialty is in Discrete Mathematics and Combinatorics. He grew up in western Kentucky, did his undergraduate work at Transylvania University in Lexington, KY, and received his Ph.D. from the University of Kentucky.