TOTAL COLORING OF LINE GRAPH AND SQUARE GRAPH FOR CERTAIN GRAPHS

Jayaraman, G and Muthuramakrishnan, D and Vishnu Kumar, S (2022) TOTAL COLORING OF LINE GRAPH AND SQUARE GRAPH FOR CERTAIN GRAPHS. Advances and Applications in Mathematical Sciences, 21 (11). pp. 6339-6344.

Text
P7-wos.pdf
Download (485kB)

Abstract

A total coloring of a graph is a coloring to the elements (vertices and edges) of the graph G, for which any adjacent vertices or edges and incident elements are colored differently. The total chromatic number of G is the minimum number of colors that needed in a total coloring. In this
paper, we have determined the total chromatic number for line graph of comb, twig, square graph of comb and twig graph.

Item Type:	Article
Subjects:	Mathematics > Graph Theory
Domains:	Mathematics
Depositing User:	Mr IR Admin
Date Deposited:	11 May 2026 06:52
Last Modified:	11 May 2026 06:53
URI:	https://ir.vistas.ac.in/id/eprint/16316

Actions (login required)

: View Item