• BRIDGE GRAPH RELATED FAMILIES OF E-CORDIAL GRAPHS
Abstract
The two copies of graph G(p,q) are joined by t paths on n-points each. These paths are bridges between the two graphs. We represent the family by G(tPn).The paths are attached at the same fixed point on G. We discuss E-cordiality of C3(Pn), K4(Pn), S4(Pn) (shel graph S4). We show that under certain conditions these graphs are E-cordial.
Keywords
graph, E-cordial, shel graph, C3, C4.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |