Zobrazeno 1 - 10
of 187
pro vyhledávání: '"Sheikholeslami, Seyed Mahmoud"'
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
Publikováno v:
In Applied Mathematics and Computation 1 May 2024 468
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:
Sheikholeslami, Seyed Mahmoud1 s.m.sheikholeslami@azaruniv.ac.ir, Volkmann, Lutz2 volkm@math2.rwth-aachen.de
Publikováno v:
Computer Science Journal of Moldova. 2024, Vol. 32 Issue 1, p19-37. 19p.
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
Autor:
Shooshtari, Hajar1 (AUTHOR), Sheikholeslami, Seyed Mahmoud1 (AUTHOR), Amjadi, Jafar1 (AUTHOR)
Publikováno v:
Polycyclic Aromatic Compounds. 2023, Vol. 43 Issue 8, p7214-7222. 9p.
Autor:
AHANGAR, HOSSEIN ABDOLLAHZADEH, SOROUDI, MARZIEH, AMJADI, JAFAR, SHEIKHOLESLAMI, SEYED MAHMOUD
Publikováno v:
Transactions on Combinatorics; Autumn2024, Vol. 13 Issue 3, p213-223, 11p
Autor:
Sheikholeslami, Seyed Mahmoud1 s.m.sheikholeslami@azaruniv.ac.ir, Volkmann, Lutz2 volkm@math2.rwth-aachen.de
Publikováno v:
Computer Science Journal of Moldova. 2023, Vol. 31 Issue 2, p169-182. 14p.
Autor:
Shooshtari, Hajar1 (AUTHOR) hajarshooshtary91@gmail.com, Sheikholeslami, Seyed Mahmoud1 (AUTHOR) s.m.sheikholeslami@azaruniv.ac.ir, Cancan, Murat2 (AUTHOR) mcancan@yyu.edu.tr
Publikováno v:
Discrete Mathematics, Algorithms & Applications. Jun2024, p1. 19p.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 1, Pp 39-49 (2021)
For a graph G, let γ(G) be the domination number, i(G) be the independent domination number and β2(G) be the 2-independence number. In this paper, we prove that for any tree T of order n ≥ 2, 4β2(T) − 3γ(T) ≥ 3i(T), and we characterize all
Externí odkaz:
https://doaj.org/article/7a40cf9c02cf473cbefcaf727138f0ad