Full Paper View Go Back
On Prime Labeling Of Some Union Graphs and Circulant Graphs
S.K. Patel1 , J.B. Vasava2
Section:Research Paper, Product Type: Isroset-Journal
Vol.5 ,
Issue.6 , pp.248-254, Dec-2018
CrossRef-DOI: https://doi.org/10.26438/ijsrmss/v5i6.248254
Online published on Dec 31, 2018
Copyright © S.K. Patel, J.B. Vasava . 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, J.B. Vasava, “On Prime Labeling Of Some Union Graphs and Circulant Graphs,” International Journal of Scientific Research in Mathematical and Statistical Sciences, Vol.5, Issue.6, pp.248-254, 2018.
MLA Style Citation: S.K. Patel, J.B. Vasava "On Prime Labeling Of Some Union Graphs and Circulant Graphs." International Journal of Scientific Research in Mathematical and Statistical Sciences 5.6 (2018): 248-254.
APA Style Citation: S.K. Patel, J.B. Vasava, (2018). On Prime Labeling Of Some Union Graphs and Circulant Graphs. International Journal of Scientific Research in Mathematical and Statistical Sciences, 5(6), 248-254.
BibTex Style Citation:
@article{Patel_2018,
author = {S.K. Patel, J.B. Vasava},
title = {On Prime Labeling Of Some Union Graphs and Circulant Graphs},
journal = {International Journal of Scientific Research in Mathematical and Statistical Sciences},
issue_date = {12 2018},
volume = {5},
Issue = {6},
month = {12},
year = {2018},
issn = {2347-2693},
pages = {248-254},
url = {https://www.isroset.org/journal/IJSRMSS/full_paper_view.php?paper_id=1000},
doi = {https://doi.org/10.26438/ijcse/v5i6.248254}
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v5i6.248254}
UR - https://www.isroset.org/journal/IJSRMSS/full_paper_view.php?paper_id=1000
TI - On Prime Labeling Of Some Union Graphs and Circulant Graphs
T2 - International Journal of Scientific Research in Mathematical and Statistical Sciences
AU - S.K. Patel, J.B. Vasava
PY - 2018
DA - 2018/12/31
PB - IJCSE, Indore, INDIA
SP - 248-254
IS - 6
VL - 5
SN - 2347-2693
ER -
512 Views
246 Downloads
160 Downloads
Abstract :
A graph G of order n is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding n such that each pair of adjacent vertices have relatively prime labels. A graph G that admits a prime labeling is called a prime graph. In this paper we investigate for prime labeling of some union graphs and later study some necessary and sufficient conditions for prime labeling of certain circulant graphs.
Key-Words / Index Term :
Prime labeling, Prime graphs, Independence number, Union of graphs, Circulant graphs
References :
[1] J. Gross and J. Yellen, “Graph theory and its applications”, CRC press, 1999
[2] D. M. Burton, “Elementary Number Theory”, Brown Publishers, Second Edition, 1990.
[3] A. Tout, A. N. Dabboucy and K. Howalla, "Prime labeling of graphs", Nat. Acad. Sci. Lett., Vol. 11 , pp. 365–368, 1982.
[4] M. Sundaram, R. Ponraj and S. Somasundaram, “Prime cordial labeling of graphs”, J. Indian Acad.Math., Vol. 27, pp. 373–390, 2005.
[5] S. K. Patel and N. P. Shrimali, “Neighborhood-prime labeling”, International Journal of Mathematics and Soft Computing, Vol. 5, pp. 17–25, 2015.
[6] J. A. Gallian, “A dynamic survey of graph labeling”, Electron. J. Combin., 2017.
[7] Hung-Lin Fu and Kuo-Ching Huang, “On prime labelling”, Discrete Math.,Vol. 127, pp. 181–186, 1994.
[8] M. A. Seoud and M. Z. Youssef, “On prime labelings of graphs”, Congr. Numer., Vol. 141, pp. 203-215, 1999.
[9] S. K. Patel and Jayesh Vasava, “On prime labeling of some union graphs”, Kragujevac journal of Mathematics, Vol. 42, pp. 441-452, 2018.
[10] 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, Vol. 73, pp. 33-55, 1998.
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.
