Product Cordial Labeling for the Line Graph of Bistar

Bosmia, M. I.; Kanani, K K

doi:10.1201/9781003038436-8

Search citation statements

Order By: Relevance

Paper Sections

Select...

South East Asian J Of Mathematics and Mathematical Sciences1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Raj and Valli [18] have obtained divisor cordial labeling for some new graphs. Bosamia and Kanani [5,6] have investigated divisor cordial labeling in the context of some graph operations. Barasara and Thakkar [1,2,3] have obtained results related to divisor cordial labeling for cycle, wheel and ladder related graphs.…”

Section: South East Asian J Of Mathematics and Mathematical Sciencesmentioning

confidence: 99%

Divisor Cordial Labeling for Some Snakes and Degree Splitting Related Graphs

Barasara¹,

Thakkar²

2023

SEAJMMS

View full text Add to dashboard Cite

For a graph G = (V (G),E(G)), the vertex labeling function is defined as a bijection f : V (G) → {1, 2, . . . , |V (G)|} such that an edge uv is assigned the label 1 if one f(u) or f(v) divides the other and 0 otherwise. f is called divisor cordial labeling of graph G if the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In 2011, Varatharajan et al. [24] have introduced divisor cordial labeling as a variant of cordial labeling. In this paper, we study divisor cordial labeling for triangular snake and quadrilateral snake. Moreover, we investigate divisor cordial labeling for the degree splitting graph of path, shell, cycle with one chord, crown and comb graph.

show abstract