No Detail Found!

Further Results on Edge Product Cordial Labeling

Author(s)
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
Abstract
IIn 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,?? (??), ??F(??), ???????1, ?????????¯¯¯¯, ?????????¯¯¯¯, ???? ∧ ???? and the graph obtained from ???? by attaching a pendant path ???????? to every vertex of ????.
Publication Details
Page(s) 23-32
DOI DOI not available
Published Journal: Proceedings of the Pakistan Academy of Sciences: A. Physical and Computational Sciences, Volume: 57, Issue: 4A, Year: 2020

Request the full text from PASTIC

Keywords
Paths Pn, Edge Product Cordial graph/labeling, Cycles Cn
0

Citations

0

Downloads

233

Views