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 fuzzyNi-cycle, bipolar fuzzyNi-tree, bipolar fuzzyNi-cut vertex, and bipolar fuzzyNi-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.

This publication has 6 references indexed in Scilit: