Ghorai Ganesh, Pal Madhumangal
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102 India.
Springerplus. 2016 Dec 20;5(1):2104. doi: 10.1186/s40064-016-3783-z. eCollection 2016.
The theory of graphs are very useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. In this paper, we present a frame work to handle -polar fuzzy information by combining the theory of -polar fuzzy sets with graphs. We introduce the notion of weak self complement -polar fuzzy graphs and establish a necessary condition for -polar fuzzy graph to be weak self complement. Some properties of self complement and weak self complement -polar fuzzy graphs are discussed. The order, size, busy vertices and free vertices of an -polar fuzzy graphs are also defined and proved that isomorphic -polar fuzzy graphs have same order, size and degree. Also, we have presented some results of busy vertices in isomorphic and weak isomorphic -polar fuzzy graphs. Finally, a relative study of complement and operations on -polar fuzzy graphs have been made. Applications of -polar fuzzy graph are also given at the end.
图论是解决计算机科学和计算智能系统不同领域组合问题的非常有用的工具。在本文中,我们通过将n - 极模糊集理论与图相结合,提出了一个处理n - 极模糊信息的框架。我们引入了弱自补n - 极模糊图的概念,并建立了n - 极模糊图为弱自补的必要条件。讨论了自补和弱自补n - 极模糊图的一些性质。还定义了n - 极模糊图的阶、大小、忙碌顶点和自由顶点,并证明了同构的n - 极模糊图具有相同的阶、大小和度。此外,我们给出了同构和弱同构n - 极模糊图中忙碌顶点的一些结果。最后,对n - 极模糊图的补和运算进行了相关研究。最后还给出了n - 极模糊图的应用。