Zobrazeno 1 - 10
of 16 371
pro vyhledávání: '"Directed Graph"'
Publikováno v:
International Journal of Productivity and Performance Management, 2024, Vol. 73, Issue 8, pp. 2673-2705.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/IJPPM-07-2023-0346
Publikováno v:
AIMS Mathematics, Vol 9, Iss 10, Pp 27834-27847 (2024)
Let $ G $ be a directed graph with $ \mathrm{o}\mathrm{r}\mathrm{d}\mathrm{e}\mathrm{r}\; n. $ The adjacency matrix of the directed graph $ G $ is a matrix $ A = \left[{a}_{ij}\right] $ of order $ n\times n, $ such that for $ i\ne j $, if there is an
Externí odkaz:
https://doaj.org/article/3538f425a9c84901b60260aeef7ff70b
Publikováno v:
Applied Network Science, Vol 9, Iss 1, Pp 1-24 (2024)
Abstract Human mobility describes physical patterns of movement of people within a spatial system. Many of these patterns, including daily commuting, are cyclic and quantifiable. These patterns capture physical phenomena tied to processes studied in
Externí odkaz:
https://doaj.org/article/20532f7b91ff4417a976671ac4681618
Autor:
Muhammad Nouman Aslam Khan, Maliha Rashid, Amna Kalsoom, Naeem Saleem, Madeeha, Manuel De La Sen
Publikováno v:
Alexandria Engineering Journal, Vol 102, Iss , Pp 1-9 (2024)
In this article, we study the convergence behavior of G-nonexpansive mappings for three-step iterations in convex metric space along with the directed graph. We demonstrate the Δ-convergence as well as the strong convergence results for these mappin
Externí odkaz:
https://doaj.org/article/96f79cda47ca4924bd58922fbcedeab0
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Nigerian Society of Physical Sciences, Vol 6, Iss 3 (2024)
This paper extends the framework of soft set theory to directed graphs by introducing and analyzing the concepts of the normal product and restricted normal product of soft directed graphs. Building on Molodtsov’s foundational work in developing so
Externí odkaz:
https://doaj.org/article/674dfbe821c440a9a8d5f97d23920727
Publikováno v:
AIMS Mathematics, Vol 9, Iss 5, Pp 11941-11957 (2024)
We have suggested a new modified iterative scheme for approximating a common fixed point of two $ G $-nonexpansive mappings. Our approach was based on an iterative scheme in the context of Banach spaces via directed graphs. First, we proved a weak co
Externí odkaz:
https://doaj.org/article/cf2437418eb9412b82f7ef0cf4f34635
Publikováno v:
Mathematics, Vol 12, Iss 23, p 3763 (2024)
Using the monophonic paths in the theory of directed graphs, this paper constructs a new topology called the out mondirected topology, which characterizes the graphs that induce indiscrete or discrete topology. We give and study some of the relations
Externí odkaz:
https://doaj.org/article/121bf423bb404837ad2117dc606bc163
Autor:
Zhang Zheng
Publikováno v:
Measurement: Sensors, Vol 33, Iss , Pp 101178- (2024)
In view of the excessive consumption of difficult resources in traditional dance choreography, insufficient data in choreography and data leakage crisis in the system, this paper puts forward artificial intelligence technology to study the protection
Externí odkaz:
https://doaj.org/article/fbf248cf70fa4b91bb365a1beea18bbc
Autor:
N. Kalaivani, E.Mona Visalakshidevi
Publikováno v:
Measurement: Sensors, Vol 33, Iss , Pp 101060- (2024)
The transportation problem is one of the vital problems in linear programming. Finding an optimal solution for it is necessary. To find an initial basic workable solution, techniques such as the North-West corner rule, least cost matrix, Vogel's appr
Externí odkaz:
https://doaj.org/article/84494d89eb7548079ea10b598bc72a17