2018, Vol. 3, Issue 1, Part D
Path and cycle related families of E-Cordial graph
Author(s): Mukund V Bapat
Abstract: The two copies of graph G(p, q) are joined by t paths on n-points each We represent the family by G(tP
n). The paths are attached at the same fixed point on G. We discuss E-cordiality of C
3(Pn), K
4(P
n), S
4(P
n) (shel graph S4 ) We show that under certain conditions these graphs are E-cordial.
Pages: 263-265 | Views: 1094 | Downloads: 18Download Full Article: Click HereHow to cite this article:
Mukund V Bapat. Path and cycle related families of E-Cordial graph. Int J Stat Appl Math 2018;3(1):263-265.
