Advanced International Journal for Research

E-ISSN: 3048-7641     Impact Factor: 9.11

A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal

Call for Paper Volume 7, Issue 1 (January-February 2026) Submit your research before last 3 days of February to publish your research paper in the issue of January-February.

Applications Of Edge Coloring Graph With Chromatic Index

Author(s) Mr. G. RAJA RAO, Prof. Dr. G.SHOBHA LATHA
Country India
Abstract A proper edge coloring of a graph is an edge coloring such that no two adjacent edges are assigned the same color. The minimum number of colors needed to color edges of G is called the chromatic index χ/(G) of G. We introduce the new term Ce - V table for finding the inequality between and the sum of the terms domination number and the chromatic number of the induced sub graph. Here we introduced the applications of the edge coloring with the chromatic number in different dominations.
Keywords Interval graph, Dominating set, Domination number of the graph G, Edge coloring, Chromatic index, Chromatic index of the vertex induced sub graph, Doubly connected dominating set, k-Regular graph.
Field Mathematics
Published In Volume 7, Issue 1, January-February 2026
Published On 2026-01-02

Share this