Zobrazeno 1 - 10
of 283
pro vyhledávání: '"Chellali Mustapha"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 3, Pp 861-891 (2022)
In this paper, we survey results on the Roman domatic number and its variants in both graphs and digraphs. This fifth survey completes our works on Roman domination and its variations published in two book chapters and two other surveys.
Externí odkaz:
https://doaj.org/article/a5a7a53503c44dbcaf2dfa2cb517bd14
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 3, Pp 1005-1022 (2022)
A perfect Italian dominating function (PIDF) on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that for every vertex u with f(u) = 0, the total weight of f assigned to the neighbors of u is exactly two. The weight of a PIDF
Externí odkaz:
https://doaj.org/article/32e01ea654834fb2bdca5344e9dc119b
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 771-785 (2020)
A Roman dominating function on a graph G = (V, E) is a function f:V (G) → {0, 1, 2} such that every vertex u for which f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman dominating function is the value w(f) = Σu∈
Externí odkaz:
https://doaj.org/article/925437db9f9e445599b163137b971ef9
Autor:
Ahangar, Hossein Abdollahzadeh, Alvarez, M. Pilar, Chellali, Mustapha, Sheikholeslami, Seyed Mahmoud, Valenzuela-Tripodoro, Juan Carlos
Publikováno v:
applied math and computation, 391 (2021)
The Roman domination in graphs is well-studied in graph theory. The topic is related to a defensive strategy problem in which the Roman legions are settled in some secure cities of the Roman Empire. The deployment of the legions around the Empire is
Externí odkaz:
http://arxiv.org/abs/2402.07009
Autor:
Chellali Mustapha, Rad Nader Jafari
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 2, Pp 337-346 (2013)
A Roman dominating function (RDF) on a graph G = (V,E) is a function f : V −→ {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF is the value f(V
Externí odkaz:
https://doaj.org/article/63d9c2ae18f644cd8a2ee9d76923e989
Autor:
Blidia, Mostafa1 m_blidia@yahoo.fr, Chellali, Mustapha1 m_chellali@yahoo.com
Publikováno v:
Communications in Combinatorics & Optimization. 2024, Vol. 9 Issue 4, p799-803. 5p.
Autor:
Boutrig, Razika1 r.bourtig@yahoo.fr, Chellali, Mustapha2 m_chellali@yahoo.com, Meddah, Nacéra2 meddahn11@yahoo.fr
Publikováno v:
Communications in Combinatorics & Optimization. Mar2025, Vol. 10 Issue 1, p69-78. 10p.
Autor:
Bouchou, Ahmed1 bouchou.ahmed@yahoo.fr, Chellali, Mustapha2 m_chellali@yahoo.com
Publikováno v:
Communications in Combinatorics & Optimization. 2024, Vol. 9 Issue 1, p1-11. 11p.
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.
Autor:
Kumar, H. Naresh1 (AUTHOR) nareshhari1403@gmail.com, Chellali, Mustapha2 (AUTHOR) m_chellali@yahoo.com, Venkatakrishnan, Y. B.1 (AUTHOR) venkatakrish2@maths.sastra.edu
Publikováno v:
International Journal of Foundations of Computer Science. Nov2024, Vol. 35 Issue 7, p857-869. 13p.