Have a personal or library account? Click to login
Some Results on Point Set Domination of Fuzzy Graphs Cover

Some Results on Point Set Domination of Fuzzy Graphs

By: S. Vimala and  J. S. Sathya  
Open Access
|May 2013

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.

DOI: https://doi.org/10.2478/cait-2013-0014 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702
Language: English
Page range: 58 - 62
Published on: May 21, 2013
Published by: Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2013 S. Vimala, J. S. Sathya, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons License.