Relations between the domination parameters and the chromatic index of a graph | Zendy

Włodzimierz Ulatowski | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Relations between the domination parameters and the chromatic index of a graph

Author(s) -

Włodzimierz Ulatowski

Publication year - 2009

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1468

Subject(s) - mathematics , combinatorics , chromatic scale , graph , index (typography) , windmill graph , friendship graph , domination analysis , edge coloring , line graph , graph power , vertex (graph theory) , computer science , world wide web

In this paper we show upper bounds for the sum and the product of the lower domination parameters and the chromatic index of a graph. We also present some families of graphs for which these upper bounds are achieved. Next, we give a lower bound for the sum of the upper domination parameters and the chromatic index. This lower bound is a function of the number of vertices of a graph and a new graph parameter which is defined here. In this case we also characterize graphs for which a respective equality holds.

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