Some Cordial Graphs in the Context of Barycentric Subdivision
Samir K. VAIDYA, Kailas Khimjibhai Kanani, P L Vihol · 2009
A new graph is introduced which is denoted as Cn(Cn). It is the graph obtained by taking barycentric subdivision of cycle and joining each newly inserted vertices of two incident edges by an edge. The graph obtained by this procedure will look like Cn inscribed in Cn. We derive three results concern to this graph. Mathematics Subject Classiflcation: 05C78