On Generalized Edge Corona Product of Graphs

MaRDI QIDQ6295205zbMATH OpenFDO

Authors Irandokht Rezaee Abdolhosseinzadeh, F. Rahbarnia

Publication date 13 December 2017

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Abstract: Let $G$ be a simple graph with $m$ edges and $H_i$, $1leqileqm$ be simple graphs too. The generalized edge corona product of graphs $G$ and $H_1,\mathrm{...},H_m$, denoted by $Gdiamond(H_1,\mathrm{...},H_m)$, is obtained by taking one copy of graphs $G$, $H_1,\mathrm{...},H_m$ and joining two end vertices of $i$-th edge of $G$ to every vertex of $H_i$, $1leqileqm$. In this paper, some results regarding the $k$-distance chromatic number of Generalized edge corona product of graphs are presented. Also, as a consequence of our results, we compute this invariant for the graphs $K_{n}diamond(H_1,\mathrm{...},H_m)$, $Tdiamond(H_1,\mathrm{...},H_m)$ and $K_{m,n}diamond(H_1,\mathrm{...},H_m)$. Moreover, the domination set, domination number and the independence number of any connected graph $G$ and arbitrary graphs $H_i$, $1leqileq|E(G)|$, are evaluated under generalized edge corona operation.

This page was built for publication: On Generalized Edge Corona Product of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6295205)