Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰
No Thumbnail Available
Date
2019-08-01
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Ankara Üniversitesi Fen Fakültesi
Abstract
The equitable edge chromatic number is the minimum number of colors required to color the edges of a graph G and satisfies the criterion, if for each vertex v∈V(G), the number of edges of any one color incident with v differs from the number of edges of any other color incident with v by atmost one. In this paper, the equitable edge chromatic number of tensor product of Path P_{m} coupled with Crown S_{n}⁰ and also two Crown graphs S_{m}⁰ along with S_{n}⁰ are obtained.
Description
Keywords
Equitable edge coloring, Tensor product, Crown graph