Open Access   Article Go Back

3-Equitable Prime Cordial Labeling of Standard Splitting Graphs

V. Sharon Philomena1 , B. Kavya2

Section:Research Paper, Product Type: Journal Paper
Volume-07 , Issue-05 , Page no. 30-34, Mar-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7si5.3034

Online published on Mar 10, 2019

Copyright © V. Sharon Philomena, B. Kavya . 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

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: V. Sharon Philomena, B. Kavya, “3-Equitable Prime Cordial Labeling of Standard Splitting Graphs,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.05, pp.30-34, 2019.

MLA Style Citation: V. Sharon Philomena, B. Kavya "3-Equitable Prime Cordial Labeling of Standard Splitting Graphs." International Journal of Computer Sciences and Engineering 07.05 (2019): 30-34.

APA Style Citation: V. Sharon Philomena, B. Kavya, (2019). 3-Equitable Prime Cordial Labeling of Standard Splitting Graphs. International Journal of Computer Sciences and Engineering, 07(05), 30-34.

BibTex Style Citation:
@article{Philomena_2019,
author = {V. Sharon Philomena, B. Kavya},
title = {3-Equitable Prime Cordial Labeling of Standard Splitting Graphs},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {07},
Issue = {05},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {30-34},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=800},
doi = {https://doi.org/10.26438/ijcse/v7i5.3034}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i5.3034}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=800
TI - 3-Equitable Prime Cordial Labeling of Standard Splitting Graphs
T2 - International Journal of Computer Sciences and Engineering
AU - V. Sharon Philomena, B. Kavya
PY - 2019
DA - 2019/03/10
PB - IJCSE, Indore, INDIA
SP - 30-34
IS - 05
VL - 07
SN - 2347-2693
ER -

           

Abstract

A 3-equitable prime cordial labeling is extension of prime cordial labeling .Splitting graph S^` (G) was introduced by Sampath Kumar and Walikar [6]. For a graph G the splitting graphS` of G is obtained by adding a new vertex v` corresponding to each vertex v of G such that N(v)=N(v^` ). In this paper we prove the splitting graph of cycleC_n, path P_n, bistar B_(n,n) and wheel W_n admits 3-equitable prime cordial labeling.

Key-Words / Index Term

Cordial labeling, 3-equitable Prime cordial labeling, Splitting graph, cycle, path, bistar and wheel

References

[1] Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, ArsCombinatoria, Vol 23, pp. 201-207, 1987.
[2] J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 16, 2017.
[3] F. Harary Graph Theory, Addition-Wesley, Reading Mass, 1972.
[4] S.Murugesan et al “3-equitable Prime Cordial labeling of graphs”, Internatinal journal of Applied Information Systems, volume 5July 2013.
[5] Rosa A, (1966) “On certain valuation of the vertices of a Graph theory of graphs” Int.Symposium Rome, Gordon and Breach, N Y Dound, Paris pp. 349-355.
[6] E.Sampathkumar and H.B. Walikar, On Splitting Graph of a Graph, J.Karnatak Univ. Sci., vol 25(13)(1980), pp 13-16.
[7] M.Sundaram, R.Ponraj and S.Somasundaram, Prime cordial labeling of graphs, Journal of Indian Academy of Mathematics, vol 27(2005), pp 373-390