Full Paper View Go Back
Prime labeling of Union Graphs
S K Patel1 , A N Kansagara2
Section:Research Paper, Product Type: Isroset-Journal
Vol.6 ,
Issue.1 , pp.86-93, Feb-2019
CrossRef-DOI: https://doi.org/10.26438/ijsrmss/v6i1.8693
Online published on Feb 28, 2019
Copyright © S K Patel, A N Kansagara . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
View this paper at Google Scholar | DPI Digital Library
How to Cite this Paper
- IEEE Citation
- MLA Citation
- APA Citation
- BibTex Citation
- RIS Citation
IEEE Style Citation: S K Patel, A N Kansagara, “Prime labeling of Union Graphs,” International Journal of Scientific Research in Mathematical and Statistical Sciences, Vol.6, Issue.1, pp.86-93, 2019.
MLA Style Citation: S K Patel, A N Kansagara "Prime labeling of Union Graphs." International Journal of Scientific Research in Mathematical and Statistical Sciences 6.1 (2019): 86-93.
APA Style Citation: S K Patel, A N Kansagara, (2019). Prime labeling of Union Graphs. International Journal of Scientific Research in Mathematical and Statistical Sciences, 6(1), 86-93.
BibTex Style Citation:
@article{Patel_2019,
author = {S K Patel, A N Kansagara},
title = {Prime labeling of Union Graphs},
journal = {International Journal of Scientific Research in Mathematical and Statistical Sciences},
issue_date = {2 2019},
volume = {6},
Issue = {1},
month = {2},
year = {2019},
issn = {2347-2693},
pages = {86-93},
url = {https://www.isroset.org/journal/IJSRMSS/full_paper_view.php?paper_id=1144},
doi = {https://doi.org/10.26438/ijcse/v6i1.8693}
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i1.8693}
UR - https://www.isroset.org/journal/IJSRMSS/full_paper_view.php?paper_id=1144
TI - Prime labeling of Union Graphs
T2 - International Journal of Scientific Research in Mathematical and Statistical Sciences
AU - S K Patel, A N Kansagara
PY - 2019
DA - 2019/02/28
PB - IJCSE, Indore, INDIA
SP - 86-93
IS - 1
VL - 6
SN - 2347-2693
ER -
433 Views
434 Downloads
135 Downloads
Abstract :
A graph with n vertices is called prime graph if its vertices can be labeled with first n positive integers such that each pair of adjacent vertices have relatively prime labels. Such a labeling is called prime labeling. It is known that graphs like gear graphs, crown graphs, helm graphs, book graphs and C_n (C_n) are prime. In this paper, we study the prime labeling of union of these graphs.
Key-Words / Index Term :
Prime labeling, union of graphs, Corona product, Cartesian Product
References :
[1] J. A. Gallian, A dynamic survey of graph labeling. The Electronic Journal of Combinatronics 2017.
[2] M. A. Seoud, A. T. Diab, and E. A. Elsahawi, On strongly-C harmonious, relatively prime, odd graceful and cordial graphs, Proc. Math. Phys. Soc. Egypt, no. 73, pp 33-55, 1998.
[3] M. A. Seoud and M. Z. Youssef, On prime labelings of graphs, Congr. Numer.,141, pp 203-215, 1999.
[4] A. Tout, A. N. Dabboucy, and K. Howalla, Prime labeling of graphs, Nat. Acad. Sci. Letters, 11 pp 365-368, 1982.
[5] S. K. Vaidya, K. Kanani, P. Vihol, and N. Dani, Some cordial graphs in the context of barycentric subdivision, Int. J. Comtemp. Math. Sciences, 4 pp 1479-1492, 2009.
You do not have rights to view the full text article.
Please contact administration for subscription to Journal or individual article.
Mail us at support@isroset.org or view contact page for more details.
