Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

TOTAL COLORING OF MIDDLE GRAPH OF CERTAIN SNAKE GRAPH FAMILIES

  • A. PUNITHA (Department of Mathematics, Vels Institute of Science, Technology and Advanced Studies(VISTAS)) ;
  • G. JAYARAMAN (Department of Mathematics, Vels Institute of Science, Technology and Advanced Studies(VISTAS))
  • Received : 2023.08.10
  • Accepted : 2023.11.29
  • Published : 2024.03.30
Download PDF
⟨ Previous Next ⟩

Abstract

A total coloring of a graph G is an assignment of colors to both the vertices and edges of G, such that no two adjacent or incident vertices and edges of G are assigned the same colors. In this paper, we have discussed the total coloring of M(Tn), M(Dn), M(DTn), M(ATn), M(DA(Tn)), M(Qn), M(AQn) and also obtained the total chromatic number of M(Tn), M(Dn), M(DTn), M(ATn), M(DA(Tn)), M(Qn), M(AQn).

Keywords

References

  1. M. Bezhad, Graphs and their chromatic numbers, Doctoral Thesis, Michigan State University, 1965. 
  2. M. Behzad, G. Chartrand and J.K. Cooper, The color numbers of complete graphs, Journal London Math. Soc. 42 (1967), 226-228.  https://doi.org/10.1112/jlms/s1-42.1.226
  3. M. Behzad, A criterian for the planarity of the total graph of a graph, Proc. Cambridge Philos. Soc. 63 (1967), 679-681.  https://doi.org/10.1017/S0305004100041657
  4. O.V. Borodin, On the total coloring planar graphs, J. Reine Angew Math. 394 (1989), 180-185. 
  5. G. Jayaraman and D. Muthuramakrishnan, Total Chromatic Number of Double Star Graph Families, Journal of Advanced Research in Dynamical and control system 10 (2018), 631-635. 
  6. G. Jayaraman and D. Muthuramakrishnan, Total Coloring of Middle, Total graph of Bistar, Double wheel and Double Crown Graph, International Journal of Scientific Research and Review 7 (2018), 442-450. 
  7. A.V. Kostochka, The total coloring of a multigraph with maximal degree 4, Discrete Math. 17 (1989), 161-163.  https://doi.org/10.1016/0012-365X(77)90146-7
  8. R. Ponraj and S. Sathish Narayanan, Mean cordiality of some snake graphs, Palastine Journal of Mathematics 4 (2015), 439-445. 
  9. M. Rosanfeld, On the total colouring of certain graphs, Israel J. Math. 9 (1972), 396-402.  https://doi.org/10.1007/BF02771690
  10. N. Vijayaditya, On total chromatic number of a graph, J. London Math Soc. (1971), 405-408. 
  11. V.G. Vizing, Some unsolved problems in graph theory, Russian Mathematical Survey 23 (1968), 125-141. https://doi.org/10.1070/RM1968v023n06ABEH001252