Coprime and prime labelings of graphs
Combinatorics
2017-08-17 v2
Abstract
A coprime labeling of a simple graph of order is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first positive integers. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss coprime labelings for complete bipartite graphs.
Cite
@article{arxiv.1604.07698,
title = {Coprime and prime labelings of graphs},
author = {Adam H. Berliner and Nathaniel Dean and Jonelle Hook and Alison Marr and Aba Mbirika and Cayla D. McBee},
journal= {arXiv preprint arXiv:1604.07698},
year = {2017}
}
Comments
14 pages, this version is the one accepted by the Journal of Integer Sequences