Abstract
Unlike the situation with graceful labelings and harmonious labelings, where a vertex labeling induces an edge labeling, the emphasis in this chapter is on graphs whose vertices can be labeled with positive integers so that the labels of every two adjacent vertices have a particular number-theoretic property.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Chartrand, G., Egan, C., Zhang, P. (2019). Prime Labelings. In: How to Label a Graph. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-16863-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-16863-6_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-16862-9
Online ISBN: 978-3-030-16863-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)