<abstract xmlns="http://www.w3.org/1999/xhtml">Let G be a fuzzy graph. Let γ(G), γp(G) denote respectively the domination number, the point set domination number of a fuzzy graph. A dominating set D of a fuzzy graph is said to be a point set dominating set of a fuzzy graph if for every S⊆V-D there exists a node d∈D such that 〈S ∪ {d}〉 is a connected fuzzy graph. The minimum cardinality taken over all minimal point set dominating set is called a point set domination number of a fuzzy graph G and it is denoted by γp(G). In this paper we concentrate on the point set domination number of a fuzzy graph and obtain some bounds using the neighbourhood degree of fuzzy graphs. </abstract>

Let G be a fuzzy graph. Let γ(G), γp(G) denote respectively the domination number, the point set domination number of a fuzzy graph. A dominating set D of a fuzzy graph is said to be a point set dominating set of a fuzzy graph if for every S⊆V-D there exists a node d∈D such that 〈S ∪ {d}〉 is a connected fuzzy graph. The minimum cardinality taken over all minimal point set dominating set is called a point set domination number of a fuzzy graph G and it is denoted by γp(G). In this paper we concentrate on the point set domination number of a fuzzy graph and obtain some bounds using the neighbourhood degree of fuzzy graphs.

Some Results on Point Set Domination of Fuzzy Graphs

Mother Teresa Women’s University, Kodaikanal-624103

Cybernetics and Information Technologies

{"article-title":"Some Results on Point Set Domination of Fuzzy Graphs"}

Let G be a fuzzy graph. Let γ(G), γp(G) denote respectively the domination number, the point set domination number of a fuzzy graph. A dominating set D of a...

Some Results on Point Set Domination of Fuzzy Graphs

Data publikacji: 21 maj 2013

Zakres stron: 58 - 62

DOI: https://doi.org/10.2478/cait-2013-0014

This content is open access.