Abstract
A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we construct the corona between paths and second power of fan graphs and explain the necessary and sufficient conditions for this construction to be cordial.
Highlights
License (CC BY 4.0).Labeling problem is important in graph theory
A graph labeling is an assignment of integers to the vertices or edges or both
The corona between G and H is the graph denoted by G H and is obtained by taking one copy of G and ni copies of H, and joining the i-th vertex of G with an edge to every vertex in the i-th copy of H [9]
Summary
The corona between G and H is the graph denoted by G H and is obtained by taking one copy of G and ni copies of H, and joining the i-th vertex of G with an edge to every vertex in the i-th copy of H [9]. It follows from the definition of the corona that G H has n1 + n1 ⋅ n2 vertices and m1 + n1 ⋅ m2 + n1 ⋅ n2 edges. In this paper we study the corona PK Fm2 and show that is cordial for all K ≥ 1 and m ≥ 4
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
