Prime Vertex Labelings Of Families Of Unicyclic Graphs

Abstract

A simple $n$-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers $1,2,3,\dots ,n$ such that adjacent vertices have relatively prime labels. We will present previously unknown prime vertex labelings for new families of graphs, all of which are special cases of Seoud and Youssef's conjecture that all unicyclic graphs have a prime labeling.

12 pages, 17 figures

Cited by in corpus (1)

• Minimum coprime graph labelings