On the edge coloring of graph products | Zendy

Mohammed M. M. Jaradat | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the edge coloring of graph products

Author(s) -

Mohammed M. M. Jaradat

Publication year - 2005

Publication title -

international journal of mathematics and mathematical sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.21

H-Index - 39

eISSN - 1687-0425

pISSN - 0161-1712

DOI - 10.1155/ijmms.2005.2669

Subject(s) - mathematics , edge coloring , combinatorics , graph coloring , graph , chromatic scale , edge contraction , brooks' theorem , product (mathematics) , fractional coloring , list coloring , enhanced data rates for gsm evolution , discrete mathematics , graph power , line graph , computer science , geometry , artificial intelligence

The edge chromatic number of G is the minimum number of colors required to color the edges of G in such a way that no two adjacent edges have the same color. We will determine a sufficient condition for a various graph products to be of class 1, namely, strong product, semistrong product, and special product

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research