Open Access
Subscription Access
Difference Cordial Labeling in context of Joint sum of Graphs
Abstract
Suppose G be a (p, q) graph. Suppose f be a map from f(G) to {1,2,...,p}. For each edge xy assign, the label |f(x) – f(y)|. f is difference cordial if f is 1-1 and |ef(0) – ef(1)| 14≤"> 1, where ef(1) and ef(0) denote the number of edges with labeled 1 except labeled with 1 respectively. A graph which admit difference cordial labeling is called a difference cordial graph.
In this paper I prove the following results.
- The joint sum of two copies of wheel graph is difference cordial.
- The joint sum of two copies of shell graph is difference cordial.
- The joint sum of two copies of double wheel graph is difference cordial.
- The joint sum of two copies of Petersen graph is difference cordial.
- The joint sum of two copies of coconut tree is difference cordial.
Full Text:
PDFRefbacks
- There are currently no refbacks.
This site has been shifted to https://stmcomputers.stmjournals.com/