Application of Bipolar Fuzzy Sets in Graph Structures
Authors:
Open Access
- 10 February 2016
- journal article
- research article
- Published by Hindawi Limited in Applied Computational Intelligence and Soft Computing
- Vol. 2016, 1-13
Abstract
A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. In this paper, we apply the concept of bipolar fuzzy sets to graph structures. We introduce certain notions, including bipolar fuzzy graph structure (BFGS), strong bipolar fuzzy graph structure, bipolar fuzzy-cycle, bipolar fuzzy-tree, bipolar fuzzy-cut vertex, and bipolar fuzzy-bridge, and illustrate these notions by several examples. We study-complement, self-complement, strong self-complement, and totally strong self-complement in bipolar fuzzy graph structures, and we investigate some of their interesting properties.
Keywords
This publication has 6 references indexed in Scilit:
- Bipolar fuzzy graphs with applicationsKnowledge-Based Systems, 2013
- Regular bipolar fuzzy graphsNeural Computing and Applications, 2011
- Bipolar fuzzy graphsInformation Sciences, 2011
- Node connectivity and arc connectivity of a fuzzy graphInformation Sciences, 2010
- Some remarks on fuzzy graphsPattern Recognition Letters, 1987
- Similarity relations and fuzzy orderingsInformation Sciences, 1971