Prime Labeling of Ladders
Combinatorics
2019-02-06 v3 Number Theory
Abstract
A prime labeling of a graph with vertices is a labeling of its vertices with distinct integers from in such a way that the labels of any two adjacent vertices are relatively prime. T. Varkey conjectured that ladder graphs have a prime labeling. We prove this conjecture.
Keywords
Cite
@article{arxiv.1610.08849,
title = {Prime Labeling of Ladders},
author = {Ebrahim Ghorbani and Sara Kamali},
journal= {arXiv preprint arXiv:1610.08849},
year = {2019}
}