Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Douglas F. Rall"'
Autor:
Sandi Klavžar, Douglas F. Rall
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 21 no. 3, Iss Graph Theory (2019)
The packing chromatic number $\chi_{\rho}(G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $V_i$, $i\in [k]$, where vertices in $V_i$ are pairwise at distance at least $i+1$. Packing chromati
Externí odkaz:
https://doaj.org/article/b28f75f16b484e539bfb1466dc7463e2
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 3, Iss Graph Theory (2016)
A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs $G$ for which the Cartesian product $G \Box H$ is an efficient open domination graph wh
Externí odkaz:
https://doaj.org/article/fb1b4606e5f84f24afe0532fdc8b8202
Autor:
Douglas F. Rall
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2, Iss 4, Pp 627-650 (1979)
A well-known theorem of N. Jacobson states that any periodic associative ring is commutative. Several authors (most notably Kaplansky and Herstein) generalized the periodic polynomial condition and were still able to conclude that the rings under con
Externí odkaz:
https://doaj.org/article/e8f242f2b9fb4feeb19decf726ffa5a8
The orientable domination number, ${\rm DOM}(G)$, of a graph $G$ is the largest domination number over all orientations of $G$. In this paper, ${\rm DOM}$ is studied on different product graphs and related graph operations. The orientable domination
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e800d700f53972fbae092696a193bf2f
http://arxiv.org/abs/2211.02395
http://arxiv.org/abs/2211.02395
Publikováno v:
Journal of Graph Theory. 99:359-377
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 4, Pp 923-970 (2020)
If S = (a1, a2, . . .) is a non-decreasing sequence of positive integers, then an S-packing coloring of a graph G is a partition of V (G) into sets X1, X2, . . . such that for each pair of distinct vertices in the set Xi, the distance between them is
Autor:
Kirsti Kuenzel, Douglas F. Rall
In \cite{nr-1996} Nowakowski and Rall listed a series of conjectures involving several different graph products. In particular, they conjectured that $i(G\times H) \ge i(G)i(H)$ where $i(G)$ is the independent domination number of $G$ and $G\times H$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bf63b80c30ff61652ab09fc2c8b38a0
The Grundy domination number, ${\gamma_{\rm gr}}(G)$, of a graph $G$ is the maximum length of a sequence $(v_1,v_2,\ldots, v_k)$ of vertices in $G$ such that for every $i\in \{2,\ldots, k\}$, the closed neighborhood $N[v_i]$ contains a vertex that do
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a12d387d9830c3b5da3a4d118f33ac1e
Autor:
Sandi Klavžar, Douglas F. Rall
Publikováno v:
Discrete Mathematics. 342:951-958
In this paper a relationship is established between the domination game and minimal edge cuts. It is proved that the game domination number of a connected graph can be bounded above in terms of the size of minimal edge cuts. In particular, if C a min
Publikováno v:
Discrete Applied Mathematics. 250:28-37
In the total domination game played on a graph G , players Dominator and Staller alternately select vertices of G , as long as possible, such that each vertex chosen increases the number of vertices totally dominated. Dominator (Staller) wishes to mi