Zobrazeno 1 - 10
of 3 788
pro vyhledávání: '"domination number"'
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:
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:
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
Autor:
Omar Tout
Publikováno v:
Discrete Mathematics Letters, Vol 13, Pp 95-99 (2024)
Externí odkaz:
https://doaj.org/article/d0881eac1e0f4353beedc8bd6c5e8d68
Autor:
Saeid Alikhani, Nima Ghanbari
Publikováno v:
AUT Journal of Mathematics and Computing, Vol 6, Iss 1, Pp 23-29 (2024)
Let $G=(V,E)$ be a simple graph. A set $D\subseteq V$ is a strong dominating set of $G$, if for every vertex $x\in V\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $\deg(x)\leq \deg(y)$. The strong domination number $\gamma_{\rm st}(G)$
Externí odkaz:
https://doaj.org/article/5bccef09bcd14e3b97d181672c37a711