Coprime and prime labelings of graphs
| Autor: | Berliner, Adam H., Dean, Nathaniel, Hook, Jonelle, Marr, Alison, Mbirika, Aba, McBee, Cayla D. |
|---|---|
| Rok vydání: | 2016 |
| Předmět: | |
| Zdroj: | Journal of Integer Sequences, Vol. 19 (2016), Article 16.5.8 |
| Druh dokumentu: | Working Paper |
| Popis: | 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 corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss coprime labelings for complete bipartite graphs. Comment: 14 pages, this version is the one accepted by the Journal of Integer Sequences |
| Databáze: | arXiv |
| Externí odkaz: |
|