Cordial Labeling of Double Antenna One Point Union Graphs
Abstract views: 19 / PDF downloads: 11
Keywords:
Cordial, labeling, tail graph, invariance, path, one point unionAbstract
We discuss graphs of type $G^{(k)}$ i.e. one point union of k-copies of G for cordial labeling. We take G as double tail graph of $C_{3}$. i.e. $G= tail(C_{3},2-P_{m})$. In $tail(C_{3},2-P_{m})$ graph double paths are attached at same point of $C_{3}$. We restrict our attention to $m = 2, 3, 4 $. Further we consider all possible structures of $G^{(k)}$ by changing the common point on G and obtain non-isomorphic structures. We show all these structures as cordial graphs. This is called as invariance of different structures under cordial labeling.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 International Journal of Mathematics And its Applications
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.