Independent edge dominating set of certain graphs
Doost Ali Mojdeh, R. Sadeghi · International Mathematical Forum · 2007
Let G =(V,E) be a finite undirected graph. A set F of the edges of a graph G is an edge dominating set if each edge of E \\ F is adjacent to an edge of F. The edge domination number γ ′ (G) ofG is the minimum cardinality of an edge dominating set of G. An independent set of edges is a set of edges, no two of which have a vertex in common. An independent edge dominating set is an independent set of edges which is edge dominating set. In this paper we are concerned with the problems of verifying a minimum independent edge dominating set in the Cartesian Product of paths Pk × Pn, Pk × Cn and Ck × Cn for every positive integer k and n. 1