Connected domination number on Cartesian product of simple fuzzy graphs

Abstract

A dominating set D of a fuzzy graph G=(V,σ,m) is connected dominating set if the induced subgraph <D> is connected. The minimum cardinality of a connected dominating set of G is called the connected domination number of G and is denoted by γ_c(G). The Cartesian product of simple fuzzy graphs is also a fuzzy graph. In this paper we introduce the connected domination number on Cartesian product of simple fuzzy graphs and obtain the results for this parameter in fuzzy graph.