Coprime and prime labelings of graphs

A coprime labeling of a simple graph of order \(n\) 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 \(n\) positive integers. In this paper, we consider when ladder graphs are prime and when the correspon...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2017-08
Hauptverfasser:	Berliner, Adam H, Dean, Nathaniel, Hook, Jonelle, Marr, Alison, Mbirika, Aba, McBee, Cayla D
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Graph theory Graphs Integers Labeling Labels
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!