On parameters of independence, domination and irredundance in edge-coloured graphs and their products

In this paper we study some parameters of domination, independence and irredundance in some edge-coloured graphs and their products. We present several general properties of independent, dominat- ing and irredundance sets in edge-coloured graphs and we give relation- ships between the independence, domination and irredundant numbers of an edge-coloured graph. We generalize some classical results concern- ing independence, domination and irredundance in graphs. Moreover we study G-join of edge-coloured graphs which preserves considered parame- ters with respect to related parameters in product factors.