Affiliations: [a] Department of Mathematics, University of the Punjab, New Campus, Lahore, Pakistan
| [b] Department of Mathematics, Division of Science and Technology, University of Education, Lahore, Pakistan
| [c] Mathematics and Science Department, University of New Mexico, Gallup, NM, USA
Correspondence:
[*]
Corresponding author. Saba Siddique, Department of Mathematics, University of the Punjab, New Campus, Lahore, P.O. Box No. 54590, Pakistan. E-mail: sabasabiha6@gmail.com.
Abstract: The concept of generalized complex neutrosophic graph of type 1 is an extended approach of generalized neutrosophic graph of type 1. It is an effective model to handle inconsistent information of periodic nature. In this research article, we discuss certain notions, including isomorphism, competition graph, minimal graph and competition number corresponding to generalized complex neutrosophic graphs. Further, we describe these concepts by several examples and present some of their properties. Moreover, we analyze that a competition graph corresponding to a generalized complex neutrosophic graph can be represented by an adjacency matrix with suitable real life examples. Also, we enumerate the utility of generalized complex neutrosophic competition graphs for computing the strength of competition between the objects. Finally, we highlight the significance of our proposed model by comparative analysis with the already existing models.
Keywords: Isomorphism, competition graphs of type 1, minimal graphs, competition matrix, comparative analysis
