• DOUBLE PATH - UNIONS OF E-CORDIAL GRAPHS
Abstract
Path unions are obtained by attaching a single copy each of given graph to the vertices of a path Pm. It is denoted by Pm(G). A double path unions is obtained by attaching two copies of given graph to each vertex of path Pm. It is denoted by Pm(2-G). We show that Pm(2-C3) , Pm(2-C4), Pm(2-kite) are families of E- cordial graphs.
Keywords
path, path union, labeling, cordial, etc.
Full Text:
PDF
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |