New concepts of vague competition graphs

Article type: Research Article

Authors: Borzooei, Rajab Ali^a | Rashmanlou, Hossein^b | Samanta, Sovan^{c; *} | Pal, Madhumangal^d

Affiliations: [a] Department of Mathematics, Shahid Beheshti University, Tehran, Iran | [b] Young Researchers and Elite club, Central Tehran Branch, Islamic Azad University, Tehran, Iran | [c] Department of Mathematics, Joykrishnapur High School (H.S.), Tamluk, India | [d] Department of Applied Mathematics with Oceanology and ComputerProgramming, Vidyasagar University, Midnapore, India

Correspondence: [*] Corresponding author. Sovan Samanta, Department of Mathematics, Joykrishnapur High School (H.S.), Tamluk 721649, India. E-mail: ssamantavu@gmail.com.

Abstract: A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, vague competition graph and m-step competition graphs related to a vague graph are introduced. Likewise, some interesting theorems on them, which are related to the independent strong edges of the vague competition graphs are investigated.

Keywords: Vague graphs, vague competition graphs, vague out-neighbourhood

DOI: 10.3233/IFS-162121

Journal: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 1, pp. 69-75, 2016