On prime labeling of union of tadpole graphs
Sanjaykumar K. Patel; Jayesh B. Vasava
Commentationes Mathematicae Universitatis Carolinae (2022)
- Volume: 62 63, Issue: 1, page 33-50
- ISSN: 0010-2628
Access Full Article
top
Abstract
topHow to cite
topPatel, Sanjaykumar K., and Vasava, Jayesh B.. "On prime labeling of union of tadpole graphs." Commentationes Mathematicae Universitatis Carolinae 62 63.1 (2022): 33-50. <http://eudml.org/doc/299268>.
@article{Patel2022,
abstract = {A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the first $n$ positive integers in such a way that the labels of any two adjacent vertices in $G$ are relatively prime. If such a labeling on $G$ exists then it is called a prime labeling. In this paper we seek prime labeling for union of tadpole graphs. We derive a necessary condition for the existence of prime labelings of graphs that are union of tadpole graphs and further show that the condition is also sufficient in case of union of two or three tadpole graphs.},
author = {Patel, Sanjaykumar K., Vasava, Jayesh B.},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {prime labeling; tadpole graph; union of graphs},
language = {eng},
number = {1},
pages = {33-50},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {On prime labeling of union of tadpole graphs},
url = {http://eudml.org/doc/299268},
volume = {62 63},
year = {2022},
}
TY - JOUR
AU - Patel, Sanjaykumar K.
AU - Vasava, Jayesh B.
TI - On prime labeling of union of tadpole graphs
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 2022
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 62 63
IS - 1
SP - 33
EP - 50
AB - A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the first $n$ positive integers in such a way that the labels of any two adjacent vertices in $G$ are relatively prime. If such a labeling on $G$ exists then it is called a prime labeling. In this paper we seek prime labeling for union of tadpole graphs. We derive a necessary condition for the existence of prime labelings of graphs that are union of tadpole graphs and further show that the condition is also sufficient in case of union of two or three tadpole graphs.
LA - eng
KW - prime labeling; tadpole graph; union of graphs
UR - http://eudml.org/doc/299268
ER -
References
top- Fu H.-L, Huang K. C., 10.1016/0012-365X(92)00477-9, Discrete Math. 127 (1994), no. 1–3, 181–186. MR1273601DOI10.1016/0012-365X(92)00477-9
- Gallian J. A., A dynamic survey of graph labeling, Electron. J. Combin. 5 (1998), Dynamic Survay 6, 43 pages. MR1668059
- Kim S.-R., Park J. Y., On super edge-magic graphs, Ars Combin. 81 (2006), 113–127. MR2267806
- Klee S., Lehmann H., Park A., 10.1016/j.akcej.2016.04.001, AKCE Int. J. Graphs Combin. 13 (2016), no. 2, 165–176. MR3560568DOI10.1016/j.akcej.2016.04.001
- Patel S. K., Shrimali N. P., Neighborhood-prime labeling of some product graphs, Algebra Discrete Math. 25 (2018), no. 1, 118–129. MR3798298
- Patel S. K., Vasava J., 10.5937/KgJMath1803441P, Kragujevac J. Math. 42 (2018), no. 3, 441–452. MR3856509DOI10.5937/KgJMath1803441P
- Tout R., Dabboucy A. N., Howalla K., Prime labeling of graphs, Nat. Acad. Sci. Lett. 11 (1982), 365–368.
- Truszczyński M., Graceful unicyclic graphs, Demonstratio Math. 17 (1984), no. 2, 377–387. MR0771559
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.