Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Rupkumar Mahapatra"'
Autor:
Rupkumar Mahapatra, Sovan Samanta, Madhumangal Pal, Tofigh Allahviranloo, Antonios Kalampakas
Publikováno v:
Mathematics, Vol 12, Iss 18, p 2898 (2024)
This paper presents a comprehensive study of the linguistic Z-graph, which is a novel framework designed to analyze linguistic structures within social networks. By integrating concepts from graph theory and linguistics, the linguistic Z-graph provid
Externí odkaz:
https://doaj.org/article/94a5c7054cb043ee8a63268e7154bfc3
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2022 (2022)
Graph colouring enjoys many practical as well as theoretical uses. Graph colouring is still a very active subject of research. This article introduces a new concept of the chromatic number of the neutrosophic graph (NG). There is a discussion of the
Externí odkaz:
https://doaj.org/article/9617ca2650744db5bda0eec0b3a8d95e
Publikováno v:
International Journal of Computational Intelligence Systems, Vol 14, Iss 1 (2021)
In the literature of graph theory, networks are represented as directed graphs or undirected graphs and a mixed of both combinations. In today's era of computing, networks like brain and facebook that do not belong to any of the mentioned networks ca
Externí odkaz:
https://doaj.org/article/bfe30664abe84debbe1c3cdf425d3381
Publikováno v:
International Journal of Computational Intelligence Systems, Vol 13, Iss 1 (2020)
The computation of link prediction is one of the most important tasks on a social network. Several methods are available in the literature to predict links in networks and RSM index is one of them. The RSM index is applicable in the fuzzy environment
Externí odkaz:
https://doaj.org/article/8b52aaf31dbf423d8993fb5b15b58896
Publikováno v:
Soft Computing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d41da79fb6f78a0fc9ee63bb5d199970
https://doi.org/10.1007/s00500-023-08234-5
https://doi.org/10.1007/s00500-023-08234-5
Publikováno v:
Journal of Applied Mathematics and Computing. 65:693-712
In the existing definition of a neutrosophic planar graph, there is a limitation. In that definition, the value of falsity in degree of planarity is 1, even then the crisp underline graph is planar. This limitation is removed in the proposed definiti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c717d6c3271db596b2f1292fc3973b3a
https://doi.org/10.1007/s12190-020-01411-x
https://doi.org/10.1007/s12190-020-01411-x
Publikováno v:
Informatica. :313-330
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e78b1989ee2df428af270a7edf6387e2
https://doi.org/10.15388/20-infor403
https://doi.org/10.15388/20-infor403
Publikováno v:
Journal of Intelligent & Fuzzy Systems. 37:2137-2151
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00cb72dd64f5f63eecf5099b4e9b90d5
https://doi.org/10.3233/jifs-181452
https://doi.org/10.3233/jifs-181452
Autor:
Rupkumar Mahapatra, Sovan Samanta, Robin Singh Bhadoria, Shah Khalid Khan, Madhumangal Pal, Usman Naseem, Jeong-Gon Lee
Graph colouring is the systemof assigning a colour to each vertex of a graph. It is done in such a way that adjacent vertices do not have equal colour. It is fundamental in graph theory. It is often used to solve real-world problems like traffic ligh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f8615a20e3253da7adb1863015a820e
https://hdl.handle.net/2123/25336
https://hdl.handle.net/2123/25336
Publikováno v:
Computational and Applied Mathematics. 38
Based on the rules of the Federal Communications Commission (FCC) of the United States, there is a problem when FM radio stations are situated nearby and transmit on channels when they are satisfactorily far separated. The difficulty of taking an opt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1830043702942bd1c3466d8f4d7ed1d7
https://doi.org/10.1007/s40314-019-0888-3
https://doi.org/10.1007/s40314-019-0888-3