Prime Labeling of Ladders

MaRDI QIDQ6279116zbMATH OpenFDO

Authors E. Ghorbani, Sara Kamali

Publication date 27 October 2016

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: A prime labeling of a graph with $n$ vertices is a labeling of its vertices with distinct integers from $1,2,ldots,n$ 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.

This page was built for publication: Prime Labeling of Ladders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6279116)