Some results on E cordial labeling of hypercube related graphs
Downloads
DOI:
https://doi.org/10.26637/MJM0804/0110Abstract
All the graphs considered in this article are finite, simple and undirected. In this paper we have proved that the hypercube graph, path union of the hypercube graphs, open star of hypercube graphs, one point union of path of hypercube graphs are E Cordial.
Keywords:
E Cordial graphs, Hypercube graph, Path union of graphs, Open star of graphs, One point union of path graphsMathematics Subject Classification:
Mathematics- Pages: 1980-1983
- Date Published: 01-10-2020
- Vol. 8 No. 04 (2020): Malaya Journal of Matematik (MJM)
R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, Springer, 2012.
Joseph A Gallian, A dynamic survey of graph labeling, Electronic Journal of Combinatorics 1 Dynamic Surveys, 2018.
V. Kaneria, M. Jariya, M. Meghpara, Graceful Labeling for Some Star Related Graphs, 9(2014), 1289-1293.
D. McGinn and E. Salehi, Cordial Sets of Hypercubes, Bulletin of Institute of Combinatorics and its Applications, 75(2015), 95-106.
M. Meghpara, Graceful Labeling for One Point Union for Path of Graphs, International Journal of Mathematics And its Applications, 3(1)(2015), 49-54.
S. K. Vaidya and N. B. Vyas, E-Cordial labeling of some mirror graphs, International Journal of Contemporary Advanced Mathematics, 2(1)(2011), 22-27.
R. Yilmaz and I. Cahit, E-cordial graphs, Ars. Combin, 46(1997), 251-266.
- NA
Similar Articles
- Rachid Belgacem, Ahmed Bokhari, Mohamed Kadi , Djelloul Ziane, Solution of non-linear partial differential equations by Shehu transform and its applications , Malaya Journal of Matematik: Vol. 8 No. 04 (2020): Malaya Journal of Matematik (MJM)
You may also start an advanced similarity search for this article.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.
