Equitable total chromatic number of splitting graph

Dimensions

Jayaraman, G. and Muthuramakrishnan, D. and Manikandan, K. (2019) Equitable total chromatic number of splitting graph. Proyecciones (Antofagasta), 38 (4). pp. 699-705. ISSN 07176279

[thumbnail of rvidal,+a45_699_705.pdf] Archive
rvidal,+a45_699_705.pdf
Download (1MB)

Abstract

Among the varius coloring of graphs, the concept of equitable total coloring of graph G is the coloring of all its vertices and edges in which the number of elements in any two color classes differ by atmost one. The minimum number of colors required is called its equitable total chromatic number. In this paper, we determine an equitable total chromatic number of splitting graph of Pn, Cn and K1,n.

Item Type: Article
Subjects: Mathematics > Group Theory
Divisions: Mathematics
Depositing User: Mr IR Admin
Date Deposited: 06 Oct 2024 06:59
Last Modified: 06 Oct 2024 06:59
URI: https://ir.vistas.ac.in/id/eprint/8861

Actions (login required)

View Item
View Item
Altmetric
Citation