sc-graphs

Abstract

Any graph operation of a graph drive only one graph structure. But eccentric graph operation of almost all the graphs drives more than one graph structure, which are interesting and marvelous one. The eccentric graph of G is denoted by ecc(G). Only few families of prime cordial eccentric graphs are investigated. A graph G is separation cordial graph, if it admits separation cordial labeling. In this paper, we investigate some new families of separation cordial eccentric graphs such as ecc(Cn K1), ecc(P(Cn(2))) and ecc(S(m; n)).

Keywords

• eccentric graph
• separation cordial graph
• crown graph
• double star graph