Open Access   Article Go Back

On Neighbourhood Difference Cordial Labeling of Networks

V.M.Chitra 1 , D. Antony Xavior2

Section:Research Paper, Product Type: Journal Paper
Volume-7 , Issue-3 , Page no. 538-543, Mar-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i3.538543

Online published on Mar 31, 2019

Copyright © V.M.Chitra, D. Antony Xavior . 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.M.Chitra, D. Antony Xavior, “On Neighbourhood Difference Cordial Labeling of Networks,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.538-543, 2019.

MLA Style Citation: V.M.Chitra, D. Antony Xavior "On Neighbourhood Difference Cordial Labeling of Networks." International Journal of Computer Sciences and Engineering 7.3 (2019): 538-543.

APA Style Citation: V.M.Chitra, D. Antony Xavior, (2019). On Neighbourhood Difference Cordial Labeling of Networks. International Journal of Computer Sciences and Engineering, 7(3), 538-543.

BibTex Style Citation:
@article{Xavior_2019,
author = {V.M.Chitra, D. Antony Xavior},
title = {On Neighbourhood Difference Cordial Labeling of Networks},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {7},
Issue = {3},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {538-543},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=3876},
doi = {https://doi.org/10.26438/ijcse/v7i3.538543}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i3.538543}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=3876
TI - On Neighbourhood Difference Cordial Labeling of Networks
T2 - International Journal of Computer Sciences and Engineering
AU - V.M.Chitra, D. Antony Xavior
PY - 2019
DA - 2019/03/31
PB - IJCSE, Indore, INDIA
SP - 538-543
IS - 3
VL - 7
SN - 2347-2693
ER -

VIEWS PDF XML
232 169 downloads 127 downloads
  
  
           

Abstract

Graph labeling is the mapping of graph elements like vertices or edges or both to set of integers under some conditions. In a binary labeling to vertices, if we assign the edge label as the difference of the label of end vertices and if the difference of the number of vertices with label 0 and 1 and difference of edges with label 0 and 1 is at most 1, then the labeling is cordial labeling. If the mapping is a one to one mapping from the vertices to the labels from {1, 2, …, p}, where p is the cardinality of the vertex set, edge label as in the cordial labeling and if the difference of the number of edges labeled with 1 and not labeled with 1 is at most 1, then the labeling is difference cordial labeling. Neighborhood difference cordial labeling is a variation of difference cordial labeling, if the difference of the number of edges labeled with 1 and not labeled with 1 at each vertex is at most 1 then the labeling is neighbourhood difference cordial labeling In this paper we investigate the neighbourhood difference cordial labeling of honey comb network, butterfly network, benes network and grid network.

Key-Words / Index Term

Honey comb network, butterfly network, benes network, grid and difference cordial label

References

[1]. I.Cahit, Cordial graph: A weaker version of graceful and harmonious graphs, Ars Combinatorial 23(1987), 201-207
[2]. R.Ponraj, S.Sathish Narayanan and R.Kala, A note on difference cordial graphs, Palestine Journal of mathematics, 4(1), (2015), 189-197.
[3].M.A.Seoud ,ShakirM.Salman , On difference cordial graphs, Mathematica Aeterna , Vol. 5, 2015, no.1, 105-124.
[4]. Mirka Miller, Indira Rajasingh, D.Ahima Emilet, D.AzubhaJemilet, d-Lucky Labeling of graphs, Procedia Computer Science 57 (2015) 766-771.
[5]. R.Ponraj, S.Sathish Narayanan and R.Kala, Difference cordial labeling of graphs, Global.J.Mat.Sciences: Theory and Practical, 3(2013), 192-201.
[6]. V.M.Chitra, D.Antony Xavier, D.Florence Isido, On neighbourhood difference cordial labeling of graphs, International Journal of Information and Computing Science, Volume 6, Issue 2, February 2019