Abstract
For a graph G = (V (G), E(G)), an edge labeling function f: E(G) → {0,1,…, k − 1} where k is an integer, 2 ≤ k ≤ |E(G)|, induces a vertex labeling function f *:V(G) → {0,1,…, k − 1} such that f *(v) is the product of the labels of the edges incident to v (mod k). This function f is called k-total edge product cordial (or simply k-TEPC) labeling of G if |(vf (i) + ef (i)) − (vf (j) + ef (j))| ≤ 1 for all i, j ∈ {0,1,…., k − 1}. In this paper, 3-total edge product cordial labeling for star related graphs is determined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
