•  
  •  
 

Neutrosophic Sets and Systems

Abstract

This study investigates fermatean neutrosophic digraphs, generalized fermatean neutrosophic digraphs, and the out-neighborhood of vertices inside generalized fermatean neutrosophic digraphs. It looks at the qualities and characteristics of generalized fermatean neutrosophic competition graphs and their matrix representations. It also establishes the minimal graph, competition number for generalized fermatean neutrosophic competition graphs, and relevant features. Finally, the paper addresses a practical implementation of these ideas.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.