Zobrazeno 1 - 10
of 3 843
pro vyhledávání: '"domination number"'
Publikováno v:
Arab Journal of Basic and Applied Sciences, Vol 31, Iss 1, Pp 580-590 (2024)
Let [Formula: see text] and [Formula: see text] be a partial transformation semigroup on [Formula: see text] Obviously, the empty set [Formula: see text] is a zero element of [Formula: see text] and denoted by 0. Let [Formula: see text] An element [F
Externí odkaz:
https://doaj.org/article/2f5c0a06dd8146479abd08a0bfa1e0a8
Publikováno v:
International Journal of Industrial Engineering and Production Research, Vol 35, Iss 3, Pp 1-11 (2024)
The increasing demand for food delivery services driven by technological innovations has led to a surge in online shopping and food ordering. Efficient logistics play a crucial role in connecting customers with restaurants seamlessly. In this context
Externí odkaz:
https://doaj.org/article/793104ced25a462aba587f2aa63cf490
Publikováno v:
Mathematics in Applied Sciences and Engineering, Vol 5, Iss 3, Pp 244-253 (2024)
Finding a group of dominant servers is a necessary step towards optimising service provisioning to all clients in the complex world of server-client networks. This crucial decision rests on the non-split dominance number in the graph architecture. We
Externí odkaz:
https://doaj.org/article/5a6283725cde4e76b163785c2956d39b
Publikováno v:
Journal of Mechanics of Continua and Mathematical Sciences, Vol 19, Iss 9, Pp 18-23 (2024)
A minimum resolving set is a resolving set with the lowest cardinality and its cardinality is a dimension of connected graph , represented by . A dominating set is a set of vertices such that each of is either in or has at least one neighbor in . The
Externí odkaz:
https://doaj.org/article/eb4b4b9fe0ea42788afa8d360855d245
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 2, Pp 171-180 (2024)
A quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighb
Externí odkaz:
https://doaj.org/article/f610d32aab714c718a924f3a453e94c9