On the Edge Coloring of Triangular Snake Graph Families
Main Article Content
Abstract
We discuss the edge chromatic number of the triangular snake graph, double triangular snake graph , triple triangular snake graph and alternate triangular snake graph . A proper edge coloring of a graph, is an assignment of colors to all the edges of graphso that the adjacent edges received distinct colors. The smallest number of colors needed for such coloring is known as edge chromatic number.
Article Details
Issue
Section
Articles