Further Results on Edge Product Cordial Labeling

Results on Edge Product Cordial Labeling

Authors

  • Mohamed Aboshady Department of Basic Science, Faculty of Engineering, The British University in Egypt, Cairo, Egypt
  • Reda Elbarkouky Department of Engineering Physics and Mathematics, Faculty of Engineering, Ain Shams University, Cairo, Egypt
  • Eliwa Roshdy Department of Basic & Applied Sciences, Arab Academy for Science, Technology and Maritime Transport, Cairo, Egypt
  • Mohamed Abdel-Azim Seoud Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt

Keywords:

Edge Product Cordial graph/labeling, Paths ????????�, Cycles ????????�

Abstract

In this paper, we present some properties of Edge Product Cordial graphs and make a survey on all graphs of order at most 6 to find out whether they are Edge Product Cordial or not. Finally, we study some families of graphs to be Edge Product Cordial or not: ????????2,???????? (????????) , ????????????????(????????), ????????????????⨀????????1, ????????????????⨀????????????????̅̅̅̅, ????????????????⨀????????????????̅̅̅̅, ???????????????? ∧ ???????????????? and the graph obtained from ???????????????? by attaching a pendant path ???????????????? to every vertex of ????????� .

References

J.A. Gallian. A Dynamic Survey of Graph Labeling. Electronic Journal of Combinatorics 23: (2020).

M.S. Aboshady. Some recent graph labelings. PhD Thesis. Ain Shams University (2019). http://research.asu.edu.eg/handle/123456789/176746

S.K. Vaidya, and C.M. Barasara. Edge product cordial labeling of graphs. Journal of Mathematical and Computational Science 2(5): 1436-1450 (2012).

S.K. Vaidya, and C.M. Barasara. Some new families of edge product cordial graphs. Advanced Modeling Optimization 15(1): 103-111 (2013).

S.K. Vaidya, and C.M. Barasara. Some edge product cordial graphs. International Journal of Mathematics and Soft Computing 3(3): 49-53 (2013).

S.K. Vaidya, and C.M. Barasara. Edge product cordial labeling in the context of some graph operations. International Journal of Mathematics and Soft Computing 3(1): 4-7 (2013).

S.K. Vaidya, and C.M. Barasara. On edge product cordial labeling of some product related graphs. International Journal of Mathematics and its Applications 2(2): 15-22 (2014).

S.K. Vaidya, and C.M. Barasara. Product and edge product cordial labeling of degree splitting graph of some graphs. Advances and Applications in Discrete Mathematics. 15(1): 61-74 (2015).

U. M. Prajapati and P. D. Shah. Some edge product cordial graphs in the context of duplication of some graph elements. Open J. Discrete Math. 6: 248-258 (2016). http://dx.doi.org/10.4236/ojdm.2016.64021

U. M. Prajapati and N. B. Patel. Edge product cordial labeling of some cycle related graphs. Open J. Discrete Math. 6(6): 268-278 (2016). http://dx.doi.org/10.4236/ojdm.2016.64023

U. M. Prajapati and N. B. Patel. Edge product cordial labeling of some graphs. Journal of Applied Mathematics and Computational Mechanics 18(1): 69-76 (2019). DOI: 10.17512/jamcm.2019.1.06

F. Harary. Graph Theory. Addison Wesley, Reading, Massachusetts (1969).

Downloads

Published

2021-08-02

How to Cite

Aboshady, M. ., Elbarkouky, R. ., Roshdy, . E. ., & Seoud, . M. A.-A. (2021). Further Results on Edge Product Cordial Labeling: Results on Edge Product Cordial Labeling. Proceedings of the Pakistan Academy of Sciences: Part A (Physical and Computational Sciences), 57(4), 23–32. Retrieved from https://www.ppaspk.org/index.php/PPAS-A/article/view/450

Issue

Section

Articles