3-total edge product cordial labeling of graphs

Hasni, Roslan; Azaizeh, Almothana

doi:10.1063/1.4932481

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction2

∈ ( )1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

2022

Publication Types

Select...

Article3

Relationship

Self Cite1

Independent2

Authors

Journals

Cited by 3 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, en incident to u, then is called k-total edge product cordial labeling if it satisfy | ( ) − ( )| ≤ 1 for all , ∈ . For details see [11,12,13,14,15,16,17,18,19,20]. Now we will define the different family of graphs.…”

Section: ∈ ( )mentioning

confidence: 99%

4-Total Edge Product Cordial Labeling of Some Standard Graphs

2018

Tamap J. Math. Stats.

View full text Add to dashboard Cite

show abstract

Section: ∈ ( )mentioning

confidence: 99%

4-Total Edge Product Cordial Labeling of Some Standard Graphs

2018

Tamap J. Math. Stats.

View full text Add to dashboard Cite

show abstract

“…Some researchers studied graphs in k-total edge product cordial labeling [19]- [23]. Vadiya et al [24] studied cordial labeling for some star related graphs and Hasni and Azaizeh [25] determined 3-total edge products cordial labeling for some star related graphs. As a continuation of these results and the results in [19], [21], the main aim of this paper is to determine the 4-total edge product cordial labeling for some star related graphs.…”

Section: Introductionmentioning

confidence: 99%

4-total edge product cordial for some star related graphs

Azaizeh

Hasni

Haddad

et al. 2022

IJECE

Self Cite

View full text Add to dashboard Cite

<p>Let G = (V (G), E(G)) be a graph, define an edge labeling function ψ from E(G) to {0, 1, . . . , k − 1} where k is an integer, 2 ≤ k ≤ |E(G)|, induces a vertex labeling function ψ∗ from V (G) to {0, 1, . . . , k − 1} such that ψ∗(v) = ψ(e1) × ψ(e2) × . . . × ψ(en) mod k where e1, e2, . . . , en are all edge incident to v. This function ψ is called a k-total edge product cordial (or simply k-TEPC) labeling of G if the absolute difference between number of vertices and edges labeling with i and number of vertices and edges labeling with j no more than 1 for all i, j ∈ {0, 1, . . . , k − 1}. In this paper, 4-total edge product cordial labeling for some star related graphs are determined.</p>

show abstract

“…, e n incident to u, then α is called k-total edge product cordial labeling if it satisfy |s(a) − s(b)| ≤ 1 for all a, b ∈ Z k . For details see [11][12][13][14][15][16][17][18][19].…”

Section: Introductionmentioning

confidence: 99%