Open Access   Article Go Back

Sum Divisor Cordial Labeling of Ring Sum of a Graph With Star Graph

D.G. Adalja1 , G. V. Ghodasara2

Section:Survey Paper, Product Type: Journal Paper
Volume-6 , Issue-6 , Page no. 1567-1573, Jun-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i6.15671573

Online published on Jun 30, 2018

Copyright © D.G. Adalja, G. V. Ghodasara . 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: D.G. Adalja, G. V. Ghodasara, “Sum Divisor Cordial Labeling of Ring Sum of a Graph With Star Graph,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.1567-1573, 2018.

MLA Style Citation: D.G. Adalja, G. V. Ghodasara "Sum Divisor Cordial Labeling of Ring Sum of a Graph With Star Graph." International Journal of Computer Sciences and Engineering 6.6 (2018): 1567-1573.

APA Style Citation: D.G. Adalja, G. V. Ghodasara, (2018). Sum Divisor Cordial Labeling of Ring Sum of a Graph With Star Graph. International Journal of Computer Sciences and Engineering, 6(6), 1567-1573.

BibTex Style Citation:
@article{Adalja_2018,
author = {D.G. Adalja, G. V. Ghodasara},
title = {Sum Divisor Cordial Labeling of Ring Sum of a Graph With Star Graph},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {6 2018},
volume = {6},
Issue = {6},
month = {6},
year = {2018},
issn = {2347-2693},
pages = {1567-1573},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2384},
doi = {https://doi.org/10.26438/ijcse/v6i6.15671573}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i6.15671573}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2384
TI - Sum Divisor Cordial Labeling of Ring Sum of a Graph With Star Graph
T2 - International Journal of Computer Sciences and Engineering
AU - D.G. Adalja, G. V. Ghodasara
PY - 2018
DA - 2018/06/30
PB - IJCSE, Indore, INDIA
SP - 1567-1573
IS - 6
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
501 348 downloads 249 downloads
  
  
           

Abstract

A sum divisor cordial labeling of a graph with vertex set is a bijection from to such that an edge is assigned the label 1 if 2 divides and 0 otherwise, then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we have derived sum divisor cordial labeling of ringsum of some graphs with star graph K1,n.

Key-Words / Index Term

Sum divisor cordial labeling, ringsum of two graphs

References

[1] D. G. Adalja and G. V. Ghodasara, “Some New Sum Divisor Cordial Graphs”, International Journal of Applied Graph Theory, Vol. 2, No.1, pp.19-33, 2018 .
[2] D. M. Burton, “Elementary Number Theory”, Brown Publishers, Second Edition, 1990.
[3] J. A. Gallian, “A Dynamic Survey of Graph Labeling”, The Electronic Journal of Combinatorics, 20, 2017, # DS6.
[4] G. V. Ghodasara and D. G. Adalja, “Divisor Cordial Labeling in Context of Ring Sum of Graphs”, International Journal of Mathematics and Soft Computing, Vol.7, No.1, pp. 23-3, 2017.
[5] J. Gross and J. Yellen, “Graph Theory and Its Applications”, CRC Press, 1999. Indian Acad. Math., 27, 2, pp.373-390, 2005.
[6] A. Lourdusamy and F. Patrick, “Sum Divisor Cordial Labeling For Star And Ladder Related Graphs”, Proyecciones Journal of Mathematics, Vol.35, No.4, pp. 437-455, 2016 .
[7] R. Varatharajan and S. Navanaeethakrishnan and K. Nagarajan, “Divisor Cordial Graphs”, International J. Math. Combin., Vol.4, pp.15-25, 2011.
[8] R. Varatharajan, S. Navanaeethakrishnan and K. Nagarajan, “Special Classes of Divisor Cordial Graphs”, International Mathematical Forum, Vol.7, No. 35, pp. 1737-1749, 2012 .