Strength of strong cycle connectivity in bipolar fuzzy graphs

Print   Print  

Authors :

S. Yahya Mohamed 1 * and N. Subashini 2

Author Address :

1 PG and Research Department of Mathematics, Government Arts College, Affiliated to Bharathidasan University, Tiruchirappalli-620022, Tamil Nadu, India.
2 Research Scholar (Part-Time), Government Arts College, Affiliated to Bharathidasan University, Tiruchirappalli-620022, Tamil Nadu, India.

*Corresponding author.

Abstract :

In this paper, the notion of cycle connectivity of bipolar fuzzy graphs is introduced. The concept of strong edge, $P$- cut node, $P$-bridge and $\theta$ – evaluation of bipolar fuzzy graphs are studied. The cycle connectivity of bipolar fuzzy trees, bipolar fuzzy cycles and complete bipolar fuzzy graphs are obtained. A condition for complete bipolar fuzzy graphs to have cyclic cut-nodes is obtained.

Keywords :

$\theta$-evaluation, Bipolar Fuzzy Graph (BFG), Bipolar Fuzzy Strength (BFS), Bipolar Fuzzy Tree (BFT), $\alpha$-Strong, $\beta$-Strong and $\delta$-arc.

DOI :

10.26637/MJM0801/0012

Article Info :

Received : October 24, 2019; Accepted : December 28, 2019.