Methods to find strength of job competition among candidates under single-valued neutrosophic soft model-Reference-Cited by-同舟云学术

Methods to find strength of job competition among candidates under single-valued neutrosophic soft model

Published:2022 Issue:3 Volume:20 Page:4609-4642
ISSN:1551-0018
Container-title:Mathematical Biosciences and Engineering
language:
Short-container-title:MBE

Author:

Shahzadi Sundas¹,Rasool Areen¹,Santos-García Gustavo²

Affiliation:

1. Department of Mathematics, Division of Science and Technology, University of Education, Lahore, Pakistan

2. IME, Universidad de Salamanca, 37007 Salamanca, Spain

Abstract

<abstract><p>Neutrosophic soft set theory is one of the most developed interdisciplinary research areas, with multiple applications in various fields such as computational intelligence, applied mathematics, social networks, and decision science. In this research article, we introduce the powerful framework of single-valued neutrosophic soft competition graphs by integrating the powerful technique of single-valued neutrosophic soft set with competition graph. For dealing with different levels of competitive relationships among objects in the presence of parametrization, the novel concepts are defined which include single-valued neutrosophic soft <bold><italic>k</italic></bold>-competition graphs and <bold> <italic>p</italic></bold>-competition single-valued neutrosophic soft graphs. Several energetic consequences are presented to obtain strong edges of the above-referred graphs. The significance of these novel concepts is investigated through application in professional competition and also an algorithm is developed to address this decision-making problem.</p></abstract>

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

Applied Mathematics,Computational Mathematics,General Agricultural and Biological Sciences,Modeling and Simulation,General Medicine

Reference36 articles.

1. J. E. Cohen, Interval graphs and food webs: a finding and a problem, Document 17696-PR, RAND Corporation, Santa Monica, 1968.

2. J. R. Lundgren, Food webs, competition graphs, competition-common enemy graphs, and niche graphs, in Applications of Combinatorics and Graph Theory to the Biological and Social Sciences, (1989), 221–243. https://doi.org/10.1007/978-1-4684-6381-1_9

3. S. R. Kim, T. A. McKee, F. R. McMorris, F. S. Roberts, p-Competition graphs, Linear Algebra Appl., 217 (1995), 167–178. https://doi.org/10.1016/0024-3795(94)00060-Q

4. R. C. Brigham, F. R. McMorris, R. P. Vitray, Tolerance competition graphs, Linear Algebra Appl., 217 (1995), 41–52. https://doi.org/10.1016/0024-3795(94)00059-M

5. H. H. Cho, S. R. Kim, Y. Nam, The $m$-step competition graph of a digraph, Discrete Appl. Math., 105 (2000), 115–127. https://doi.org/10.1016/S0166-218X(00)00214-6

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cubic directed graphs with application;Journal of Applied Mathematics and Computing;2024-03-25

2. Algorithms for computing Pythagorean fuzzy average edge connectivity of Pythagorean fuzzy graphs;Journal of Applied Mathematics and Computing;2024-01-08

3. On single-valued neutrosophic soft uniform spaces;AIMS Mathematics;2024

4. Rough approximations of similarity measures under Pythagorean fuzzy information: a novel approach to decision-making;Soft Computing;2023-10-05

5. An Autocratic Strategy for Multi-attribute Group Decision Making Based on Neutrosophic Triplets: A Case Study in Prioritizing Recreation Areas in the Tourist Industries;Studies in Informatics and Control;2023-03-07