On Prime Cordial Labeling of Graphs

Aljouiee, Abdullah

doi:10.5666/kmj.2016.56.1.41

Search citation statements

Order By: Relevance

Paper Sections

Select...

Results1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let n = 4k + 3 and k ∈ N. As in case 4 of Theorem 3.1, fix the label to the vertices u, v, ui (1 ≤ i ≤ 4k + 3) and vi (1 ≤ i ≤ 4k + 3) together with the 4-total prime cordial f of G is also satisfies the condition of 4-total prime cordial labeling of this case. Then tpφ (1)…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Union Of 4-Total Prime Cordial Graph G With The Bistar Bn,N

S. Pasunkili Pandian

2023

cienc.eng.

View full text Add to dashboard Cite

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k ∈ N is a variable and k > 1. For each edge uv, assign the label gcd(f (u), f (v)). The map f is called a k- Total prime cordial labeling of G if |tpf (i) − tpf (j)| ≤ 1, i, j ∈ {1, 2, · · · , k} where tpf (x) denotes the total number of vertices and the edges labelled with x. A graph with a k-total prime cordial labeling is called k-total prime cordial graph. In this paper we investigate the 4-total prime cordial labeling of G ∪ Bn,n, where G has a 4-total prime cordial labeling and Bn,n is a bistar.

show abstract

Section: Resultsmentioning

confidence: 99%

“…A weaker version of graceful and harmonious labeling called cordial labeling was introduced by cahit [2]. Several cordial related labelings have been studied in [1,10,4]. Ponraj et al [6], have been introduced the notion of k-total prime cordial labeling and the k-total prime cordial labeling of some graphs have been investigated.…”

Section: Introductionmentioning

confidence: 99%

Union Of 4-Total Prime Cordial Graph G With The Bistar Bn,N

S. Pasunkili Pandian

2023

cienc.eng.

View full text Add to dashboard Cite

show abstract

On Prime Cordial Labeling of Graphs

Cited by 1 publication

References 3 publications

Union Of 4-Total Prime Cordial Graph G With The Bistar Bn,N

Union Of 4-Total Prime Cordial Graph G With The Bistar Bn,N

Contact Info

Product

Resources

About