ON FINITE PRIME DISTANCE GRAPHS
| Autor: | A. Parthiban, G. Samdanielthompson, K. Sathish Kumar |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Indian Journal of Pure and Applied Mathematics. 52:22-26 |
| ISSN: | 0975-7465 0019-5588 |
| DOI: | 10.1007/s13226-021-00135-3 |
| Popis: | A graph G is a prime distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is a prime number. It is known that cycles and bipartite graphs are prime distance graphs. In this paper we derive some general results concerning prime distance labeling of graphs and also establish interesting results for complete graphs, wheel graphs, and wheel-related graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink