Some Families of Convex Polytopes Labeled by 3-Total Edge Product CordialLabeling
Keywords:
3-TEPC labeling, The graphs of convex polytopesAbstract
For a graph G = (VG, EG), consider a mapping h : EG → {0, 1, 2, . . . , k − 1}, 2 ≤ k ≤ |EG| which induces a mapping h ∗ : VG → {0, 1, 2, . . . , k − 1} such that h ∗ (v) = Qn i=1 h(ei)( mod k), where ei is an edge incident to v. Then h is called k-total edge product cordial ( kTEPC) labeling of G if |s(i) − s(j)| ≤ 1 for all i, j ∈ {1, 2, . . . , k − 1}.Here s(i) is the sum of all vertices and edges labeled by i. In this paper, we study k-TEPC labeling for some families of convex polytopes for k = 3.
Downloads
Download data is not yet available.
Downloads
Published
2017-12-31
Issue
Section
Articles
How to Cite
Some Families of Convex Polytopes Labeled by 3-Total Edge Product CordialLabeling. (2017). Punjab University Journal of Mathematics, 49(3), 112-125. https://pujm.pu.edu.pk/index.php/pujm/article/view/111