DETERMINATION OF EQUITABLE CHROMATIC INDEX OF HELM, WHEEL AND SUN-LET GRAPHS

Jayaraman, G and Maheswari, V and Punitha, A (2025) DETERMINATION OF EQUITABLE CHROMATIC INDEX OF HELM, WHEEL AND SUN-LET GRAPHS. In: The Convergence of Theory and Practice in Applied Science and Technology. 1 ed. Leilani Katie Publication and PRESS Madurai - 625003, Tamil Nadu, India., pp. 45-52. ISBN 978-93-6348-116-9

[thumbnail of Book Chapter 3.pdf] Text
Book Chapter 3.pdf - Published Version
Download (1MB)

Abstract

An equitable edge coloring of a graph is a proper edge coloring for which the difference between any two color classes is at most one. The minimum cardinality of G for such coloring is called equitable edge chromatic number. In this article, we determine the theorem on equitable edge coloring for sunlet graph, wheel graph and helm graph.

Item Type: Book Section
Subjects: Mathematics > Graph Theory
Domains: Mathematics
Depositing User: IR Admin
Date Deposited: 03 Sep 2026 05:15
Last Modified: 09 Sep 2026 06:15
URI: https://ir.vistas.ac.in/id/eprint/22405

Actions (login required)

View Item
View Item