Minimum Coprime Labelings for Operations on Graphs
From MaRDI portal
Publication:5383279
zbMath1416.05244arXiv1707.04471MaRDI QIDQ5383279
Publication date: 21 June 2019
Full work available at URL: https://arxiv.org/abs/1707.04471
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)
Related Items (4)
Minimum Coprime Labelings of Generalized Petersen and Prism Graphs ⋮ Graph Labelings: A Prime Area to Explore ⋮ Unnamed Item ⋮ Minimum coprime graph labelings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trees are almost prime
- Prime labeling of graphs
- On prime labellings
- A dynamic survey of graph labeling
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
- Coprime and prime labelings of graphs
- On the interval containing at least one prime number
This page was built for publication: Minimum Coprime Labelings for Operations on Graphs