Open Access   Article Go Back

Path Related Balanced Divided Square Difference Cordial Graphs

A. Alfred Leo1 , R. Vikramaprasad2

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-6 , Page no. 727-731, Jun-2018

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

Online published on Jun 30, 2018

Copyright © A. Alfred Leo, R. Vikramaprasad . 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: A. Alfred Leo, R. Vikramaprasad, “Path Related Balanced Divided Square Difference Cordial Graphs,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.727-731, 2018.

MLA Style Citation: A. Alfred Leo, R. Vikramaprasad "Path Related Balanced Divided Square Difference Cordial Graphs." International Journal of Computer Sciences and Engineering 6.6 (2018): 727-731.

APA Style Citation: A. Alfred Leo, R. Vikramaprasad, (2018). Path Related Balanced Divided Square Difference Cordial Graphs. International Journal of Computer Sciences and Engineering, 6(6), 727-731.

BibTex Style Citation:
@article{Leo_2018,
author = {A. Alfred Leo, R. Vikramaprasad},
title = {Path Related Balanced Divided Square Difference Cordial Graphs},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {6 2018},
volume = {6},
Issue = {6},
month = {6},
year = {2018},
issn = {2347-2693},
pages = {727-731},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2245},
doi = {https://doi.org/10.26438/ijcse/v6i6.727731}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i6.727731}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2245
TI - Path Related Balanced Divided Square Difference Cordial Graphs
T2 - International Journal of Computer Sciences and Engineering
AU - A. Alfred Leo, R. Vikramaprasad
PY - 2018
DA - 2018/06/30
PB - IJCSE, Indore, INDIA
SP - 727-731
IS - 6
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
746 247 downloads 206 downloads
  
  
           

Abstract

In this article, we have investigated the balanced divided square difference cordial behavior of some path related graphs such as fan graph, half gear graph, triangular snake, double triangular snake, alternate triangular snake, V_D (P_n ).

Key-Words / Index Term

fan graph, half gear graph, triangular snake, double triangular snake, alternate triangular snake.

References

[1] A.Alfred Leo, R.Vikramaprasad, R.Dhavaseelan; Divided square difference cordial labeling graphs, International Journal of Mechanical Engineering and Technology, vol.9,Issue 1, pp.1137 – 1144, 2018.
[2] A.Alfred Leo, R.Vikramaprasad, Cycle related balanced divided square difference cordial graphs, Accepted in Journal of Computer and Mathematical Sciences.
[3] I. Cahit, “Cordial graphs: a weaker version of graceful and harmonious graphs,” Ars Combinatoria, vol.23, pp. 201 – 207, 1987.
[4] S.N.Daoud, Edge odd graceful labeling of some path and cycle related graphs, AKCE International Journal of Graphs and Combinatorics, vol.14, pp.178 – 203, 2017.
[5] R.Dhavaseelan, R.Vikramaprasad, S.Abhirami; A new notions of cordial labeling graphs, Global Journal of Pure and Applied Mathematics, vol.11, Issue 4, pp.1767 – 1774, 2015.
[6] J. A. Gallian, A dynamic survey of graph labeling, Electronic J. Combin. vol.15, DS6, pp.1 – 190, 2008.
[7] F. Harary, “Graph theory”, Addison-Wesley, Reading, MA. 1969.
[8] V.J.Kaneria, Kalpesh M.Patadiya, Jeydev R.Teraiya, Balanced cordial labeling and its applications to produce new cordial families, International Journal of Mathematics and its Applications, vol.4,Issue 1-C,pp.65 – 68, 2016.
[9] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris (1967), pp.349 – 355.
[10] S.S.Sandhya, S.Somasundaram, S.Anusha, Some more results on root square mean graphs, Journal of Mathematics Research,Vol.7, Issue.1,pp.72 – 81, 2015.
[11] R.Varatharajan, S.Navaneethakrishnan, K.Nagarajan, Divisor cordial graphs, International J.Math. Combin, Vol.4, pp.15 – 25, 2011.