Equitable Total Coloring of Wheel Related Graphs
Sudhakar, R and Jayaraman, G (2025) Equitable Total Coloring of Wheel Related Graphs. In: Global Conference on Computational Mathematics and Intelligent Engineering Applications (GCCMIEA 2025), Dec 27 to29 _2025, Thailand.
![[thumbnail of GCCMIEA-Conf_Sudhakar_Jay-2025.pdf]](https://ir.vistas.ac.in/style/images/fileicons/text.png)
Text
GCCMIEA-Conf_Sudhakar_Jay-2025.pdf - Published Version
Download (794kB)
Abstract
An equitable total coloring of a graph is a proper total coloring where the number of vertices and edges in any two color classes differ by at most one. The minimum number
of colors needed for such a coloring, which is called the equitable total chromatic number.In this paper, we verified Fu's conjecture for closed helm, flower, blossom, double wheel, sun-flower graph.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Mathematics > Graph Theory |
| Domains: | Mathematics |
| Depositing User: | IR Admin |
| Date Deposited: | 03 Sep 2026 08:50 |
| Last Modified: | 03 Sep 2026 08:50 |
| URI: | https://ir.vistas.ac.in/id/eprint/22466 |
Actions (login required)
- View Item