Some Edge Product Cordial Graphs

Vaidya, S. K.; Barasara, C. M.

doi:10.26708/ijmsc.2013.3.3.07

Cited by 8 publications

(10 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…e concept named product cordial labeling was first presented by Sundaram et al [11]. A variation in the cordial theme, namely, edge product cordial labeling and a TEPC labeling was introduced by Vaidya and Barasara [12,13].…”

Section: Introduction and Definitionsmentioning

confidence: 99%

3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph

Rahmat

Numan

Yannick

et al. 2021

Journal of Mathematics

View full text Add to dashboard Cite

Let G be a simple graph with vertex set V G and edge set E G . An edge labeling δ : E G ⟶ 0,1 , … , p − 1 , where p is an integer, 1 ≤ p ≤ E G , induces a vertex labeling δ ∗ : V H ⟶ 0,1 , … , p − 1 defined by δ ∗ v = δ e 1 δ e 2 ⋅ δ e n mod p , where e 1 , e 2 , … , e n are edges incident to v . The labeling δ is said to be p -total edge product cordial (TEPC) labeling of G if e δ i + v δ ∗ i − e δ j + v δ ∗ j ≤ 1 for every i , j , 0 ≤ i ≤ j ≤ p − 1 , where e δ i and v δ ∗ i are numbers of edges and vertices labeled with integer i , respectively. In this paper, we have proved that the stellation of square grid graph admits a 3-total edge product cordial labeling.

show abstract

Section: Introduction and Definitionsmentioning

confidence: 99%

3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph

Rahmat

Numan

Yannick

et al. 2021

Journal of Mathematics

View full text Add to dashboard Cite

show abstract

“…, e n incident to u, then α is called edge product cordial labeling if |v α (0, 1)| ≤ 1 and |e α (0, 1)| ≤ 1. For details see [7,8]. Definition 6.…”

Section: Introductionmentioning

confidence: 99%

3-total edge mean cordial labeling of some standard graphs

Aslam¹,

Zahid²,

Zafar³

2019

Open j. Math. Sci

View full text Add to dashboard Cite

show abstract

“…The concept of 3-Total super product cordial labeling of graphs was introduced by Tenguria Abha and Verma Rinku [6]. Edge product cordial labeling of graphs was introduced by S. K. Vaidya and C. M. Barasara [8]. Here brief summary of definitions are given which are useful for the present investigations.…”

Section: Introductionmentioning

confidence: 99%