Open Access   Article Go Back

?-Graceful Labeling In the Perspective of Graph Operations on Bistar

Mehul Chaurasiya1 , Mehul Rupani2

Section:Research Paper, Product Type: Journal Paper
Volume-9 , Issue-1 , Page no. 36-39, Jan-2021

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v9i1.3639

Online published on Jan 31, 2021

Copyright © Mehul Chaurasiya, Mehul Rupani . 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: Mehul Chaurasiya, Mehul Rupani, “?-Graceful Labeling In the Perspective of Graph Operations on Bistar,” International Journal of Computer Sciences and Engineering, Vol.9, Issue.1, pp.36-39, 2021.

MLA Style Citation: Mehul Chaurasiya, Mehul Rupani "?-Graceful Labeling In the Perspective of Graph Operations on Bistar." International Journal of Computer Sciences and Engineering 9.1 (2021): 36-39.

APA Style Citation: Mehul Chaurasiya, Mehul Rupani, (2021). ?-Graceful Labeling In the Perspective of Graph Operations on Bistar. International Journal of Computer Sciences and Engineering, 9(1), 36-39.

BibTex Style Citation:
@article{Chaurasiya_2021,
author = {Mehul Chaurasiya, Mehul Rupani},
title = {?-Graceful Labeling In the Perspective of Graph Operations on Bistar},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {1 2021},
volume = {9},
Issue = {1},
month = {1},
year = {2021},
issn = {2347-2693},
pages = {36-39},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=5292},
doi = {https://doi.org/10.26438/ijcse/v9i1.3639}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v9i1.3639}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=5292
TI - ?-Graceful Labeling In the Perspective of Graph Operations on Bistar
T2 - International Journal of Computer Sciences and Engineering
AU - Mehul Chaurasiya, Mehul Rupani
PY - 2021
DA - 2021/01/31
PB - IJCSE, Indore, INDIA
SP - 36-39
IS - 1
VL - 9
SN - 2347-2693
ER -

VIEWS PDF XML
446 432 downloads 218 downloads
  
  
           

Abstract

A ?-graceful labelling of a graph G =(V,E) , if a function f:V(G)?{0,1,2,…,n-1} is an injective function and the induced function f^*:E(G)?N is defined by f^* (e=mn)=2{f(m)+f(n)};where ?mn?E(G), then the resultant edge labels are distinct[3]. Here we discuss about some basic graph like as splitting graph of bistarB_(n,m),degree splitting graph of bistarB_(n,m),shadow graph of bistarB_(n,m),restricted square graph of bistar B_(n,m), barycentric sub division of bistarB_(n,m)and corona product ofbistarB_(n,m)with K1 admits?- graceful labelling.

Key-Words / Index Term

Graceful labeling, Bistar Graph, Injective function

References

[1]. M.I.Bosamia, K.K.Kanani, “Divisor cordial labeling in the context of graph operations on Bistar”, Global Journal of Pure and Applied Mathematics, Volume 12, Number 3, pp.2605-2618, 2016.
[2]. I.Cahit, Cordial Graphs, “Aweakerversion of graceful and harmonious graphs”, Ars Combinatoria, 23, pp.201–207, 1987
[3]. M.Chaurasiya, M.Rupani, S.Khunti, “?-graceful labeling of merge graph,bistar graph,friendship graph,C_d^n relation graph”, International journal of Technical Innovation in Modern Engineering & Science,Vol.6, Issue 11, pp.7-14, Nov-2020.
[4]. J.A. Gallian, “A Dynamic Survey of graph labeling”, The Electronics Journal of Combinatorics, Dec 20, 2013.
[5]. J. Gross and J. Yellen, Handbook of Graph Theory, CRC Press, 2004.
[6]. R.Uma ,S.Divya , “Cube difference labeling of star related graphs”, International Journal Of Scientific Research In Computer Science, Engineering and Information Technology, 2(4), pp.298- 301, 2017.
[7]. R.Varatharajan, S.Navanaeethakrishnan, K.Nagarajan, “Divisor cordial graphs”, International Journal of Mathematical Combinatorics, 4, pp.15–25, 2011.