We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Cordial Labeling on Few Graphs of Subdividedshell Graphs.
- Authors
Devakirubanithi, D.; Jesintha, J. Jeba
- Abstract
In 1987, Cahit[1]implemented cordial labeling. Cordial labeling[1] is defined as a function h: V (ΞΈ) β {0,1}in which each edge ab is assigned the label h π β h(π) with the conditions eh 0 β eh 1 β€ 1 and πh 0 β πh 1 β€ 1 where eh 0 and eh 1 signify the number of vertices with 0's and 1's, similarly πh 0 andπh 1 signify the number of edges with 0's and 1's. We want to show that the graphssuch as uniform sub-divided shell bow graph, uniform sub-divided shell flower graph, one point union of multiple sub-divided shell graph, sub-divided shell Graph with star graphs coupled to the apex and path vertices are cordial.
- Subjects
GRAPH theory; GEOMETRIC vertices; MATHEMATICAL bounds; STAR graphs (Graph theory); EDGES (Geometry)
- Publication
Journal of Algebraic Statistics, 2022, Vol 13, Issue 2, p3455
- ISSN
1309-3452
- Publication type
Article