Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Kos, Tim"'
A sequence $(v_1,\ldots ,v_k)$ of vertices in a graph $G$ without isolated vertices is called a total dominating sequence if every vertex $v_i$ in the sequence totally dominates at least one vertex that was not totally dominated by $\{v_1,\ldots , v_
Externí odkaz:
http://arxiv.org/abs/1906.12235
Autor:
Duh, Emilija Stojmenova, Duh, Andrej, Droftina, Uroš, Kos, Tim, Duh, Urban, Korošak, Tanja Simonič, Korošak, Dean
Scholarly communication is today immersed in publish or perish culture that propels noncooperative behaviour in the sense of strategic games played by researchers. Here we introduce and describe a blockchain based platform for decentralized scholarly
Externí odkaz:
http://arxiv.org/abs/1810.10263
A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths (respectively, all ve
Externí odkaz:
http://arxiv.org/abs/1704.08484
A sequence of vertices in a graph $G$ with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was not totally dominated by preceding vertices in the sequence, and, at
Externí odkaz:
http://arxiv.org/abs/1608.06804
Ho proved in [A note on the total domination number, Util.Math. 77 (2008) 97--100] that the total domination number of the Cartesian product of any two graphs with no isolated vertices is at least one half of the product of their total domination num
Externí odkaz:
http://arxiv.org/abs/1607.01909
A graph $G$ is said to be $1$-perfectly orientable if it has an orientation such that for every vertex $v\in V(G)$, the out-neighborhood of $v$ in $D$ is a clique in $G$. In $1982$, Skrien posed the problem of characterizing the class of $1$-perfectl
Externí odkaz:
http://arxiv.org/abs/1604.04598
A sequence $S=(v_1,\ldots,v_k)$ of distinct vertices of a graph $G$ is called a legal sequence if $N[v_i] \setminus \cup_{j=1}^{i-1}N[v_j]\not=\emptyset$ for any $i$. The maximum length of a legal (dominating) sequence in $G$ is called the Grundy dom
Externí odkaz:
http://arxiv.org/abs/1603.05116
Publikováno v:
In Applied Mathematics and Computation 1 July 2019 352:211-219
Publikováno v:
In Discrete Applied Mathematics 30 October 2018 248:33-45
Publikováno v:
In Theoretical Computer Science 19 June 2018 730:32-43