Saved in:
Bibliographic Details
Main Authors: Fox, N. Bradley, Spaeth, Joseph
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2601.14535
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917214570938368
author Fox, N. Bradley
Spaeth, Joseph
author_facet Fox, N. Bradley
Spaeth, Joseph
contents A total prime labeling of a graph of order $n$ is an extension of a prime labeling in which we distinctly label the vertices and edges. The goal of the labeling is for adjacent vertex labels to be relatively prime, and for each vertex of degree at least two, the greatest common divisor of the labels on its incident edges is equal to 1. In this paper, we construct total prime labelings by extending known prime and minimum coprime labelings and by developing new constructions for various classes of graphs. In particular, we show that snakes, books, prisms, prime trees, certain families of windmills, and other families of graphs are total prime.
format Preprint
id arxiv_https___arxiv_org_abs_2601_14535
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Total Prime Labelings of Various Graphs
Fox, N. Bradley
Spaeth, Joseph
Combinatorics
05C78
A total prime labeling of a graph of order $n$ is an extension of a prime labeling in which we distinctly label the vertices and edges. The goal of the labeling is for adjacent vertex labels to be relatively prime, and for each vertex of degree at least two, the greatest common divisor of the labels on its incident edges is equal to 1. In this paper, we construct total prime labelings by extending known prime and minimum coprime labelings and by developing new constructions for various classes of graphs. In particular, we show that snakes, books, prisms, prime trees, certain families of windmills, and other families of graphs are total prime.
title Total Prime Labelings of Various Graphs
topic Combinatorics
05C78
url https://arxiv.org/abs/2601.14535