Zobrazeno 1 - 5
of 5
pro vyhledávání: '"A. Sayed-Khalkhali"'
Publikováno v:
Transactions on Combinatorics, Vol 5, Iss 3, Pp 1-9 (2016)
A set $S$ of vertices in a graph $G=(V,E)$ is called a total$k$-distance dominating set if every vertex in $V$ is withindistance $k$ of a vertex in $S$. A graph $G$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (G - x) < gamma_{t}^{k}(G)
Externí odkaz:
https://doaj.org/article/fa700fb1a63a4cdd95d51aa044c792c0
Publikováno v:
Proceedings of the National Academy of Sciences, India Section A: Physical Sciences; Mar2020, Vol. 90 Issue 1, p141-147, 7p
Autor:
MOJDEH, D. A.1,2 damojdeh@umz.ac.ir, SAYED-KHALKHALI, A.2 a.s.khalkhali@gmail.com, AHANGAR, H. ABDOLLAHZADEH3 ha.ahangar@nit.ac.ir, ZHAO, Y.4 zhaoyc69@126.com
Publikováno v:
Transactions on Combinatorics. 2016, Vol. 5 Issue 3, p1-9. 9p.
Autor:
Mojdeh, D. A.1 damojdeh@umz.ac.ir, Samadi, B.1 samadibabak62@gmail.com
Publikováno v:
Opuscula Mathematica. 2017, Vol. 37 Issue 3, p447-456. 10p.
Publikováno v:
Electronic Journal of Graph Theory & Applications; 2020, Vol. 8 Issue 2, p353-364, 12p