Affiliations: [a] Mazandaran Adib Institute of Higher Education, Sari, Iran
| [b]
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, India
| [c]
Department of Physics, Sari Branch, Islamic Azad University, Sari, Iran
| [d]
Department of Industrial Engineering, Yonsei University, Sinchon-dong, Seodaemun-gu, Seoul, South Korea.
Correspondence:
[*]
Corresponding author. Biswajit Sarkar, Department of Industrial Engineering, Yonsei University, 50 Yonsei-ro, Sinchon-dong, Seodaemun-gu, Seoul, 03722, South Korea. E-mail: [email protected].
Abstract: Theoretical concepts of graphs are highly utilized by computer science applications. Especially in research areas of computer science such as data mining, image segmentation, clustering, image capturing and networking. The intuitionistic fuzzy graphs are more flexible and compatible than fuzzy graphs due to the fact that they have many applications in networks. The main purpose of this paper is to introduce some connectivity concepts in the intuitionistic fuzzy graphs. Analogous to fuzzy cutvertices and fuzzy bridges in fuzzy graphs, intuitionistic fuzzy cutvertices and intuitionistic fuzzy bridges are introduced and characterized. We also proposed the concept of gain and loss for paths and pairs of vertices. Finally, we give an application of intuitionistic fuzzy digraphs.
