2016/10/27 by Ebrahim Ghorbani, Ghorbani, Ebrahim, Sara Kamali +1
Computer Science · Engineering · #05C78 #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Number Theory (math.NT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1610.08849
openalex publication_date 2016/10/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A prime labeling of a graph with n vertices is a labeling of its vertices with distinct integers from \1, 2,… , 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.