sc-graphs

Authors

  • K Periasamy P.G. and Research Department of Mathematics, Dr. Kalaignar Government Arts College (Affiliated to Bharathidasan University), Kulithalai, Tiruchirappalli, India.
  • K Venugopal P.G. and Research Department of Mathematics, Dr. Kalaignar Government Arts College (Affiliated to Bharathidasan University), Kulithalai, Tiruchirappalli, India.
  • P Lawrence Rozario Raj P.G. and Research Department of Mathematics, St. Joesph’s College (Affiliated to Bharathidasan University), Tiruchirappalli

DOI:

https://doi.org/10.23755/rm.v50i0.1549

Keywords:

Eccentric graph, separation cordial graph, crown graph, double star graph

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)).

Author Biographies

  • K Periasamy, P.G. and Research Department of Mathematics, Dr. Kalaignar Government Arts College (Affiliated to Bharathidasan University), Kulithalai, Tiruchirappalli, India.

    P.G. and Research Department of Mathematics, Dr. Kalaignar Government Arts College (Affiliated to Bharathidasan University), Kulithalai, Tiruchirappalli, India.

  • K Venugopal, P.G. and Research Department of Mathematics, Dr. Kalaignar Government Arts College (Affiliated to Bharathidasan University), Kulithalai, Tiruchirappalli, India.

    P.G. and Research Department of Mathematics, Dr. Kalaignar Government Arts College (Affiliated to Bharathidasan University), Kulithalai, Tiruchirappalli, India.;

  • P Lawrence Rozario Raj, P.G. and Research Department of Mathematics, St. Joesph’s College (Affiliated to Bharathidasan University), Tiruchirappalli

    P.G. and Research Department of Mathematics, St. Joesph’s College (Affiliated to Bharathidasan University), Tiruchirappalli

References

J. Akiyama, K. Ando, and D. Avis. Eccentric graphs. Discrete Math., 56:1–6, 1985.

I. Cahit. Cordial graphs: A weaker version of graceful and harmonious graphs. Ars Combinatoria, 23:201–207, 1987.

Elachini V. Lal. Separation cordial labeling of graphs. Elixir Appl. Math., 80: 30863–30869, 2015a.

Elachini V. Lal. Separation cordial labeling for some star and bistar related graphs. Elixir Dis. Math., 83:32771–32775, 2015b.

J. A. Gallian. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics, #DS6:1–535, 2019.

R. L. Graham and N. J. J. Sloane. On additive bases and harmonious graphs. SIAM J. Alg. Discrete Math., 1:382–404, 1980.

F. Harary. Graph Theory. Addison-Wesley, Reading, Mass, 1972.

S. Kaspar, B. Gayathri, M. P. Kulandaivel, and N. Shobanadevi. Eccentric graphs of some particular classes of graphs. International Journal of Pure and Applied Mathematics, 16(119):145–152, 2018.

Poulomi Ghosh and Anita Pal. Prime cordial labeling on eccentric graph of cycle and path. Advanced Modeling and Optimization, 19(1):133–139, 2017.

Downloads

Published

2023-12-29