Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Koch, Garrison"'
Autor:
Koch, Garrison, Shank, Nathan
Given a graph $G=(V,E)$, the dominating number of a graph is the minimum size of a vertex set, $V' \subseteq V$, so that every vertex in the graph is either in $V'$ or is adjacent to a vertex in $V'$. A Roman Dominating function of $G$ is defined as
Externí odkaz:
http://arxiv.org/abs/2305.16256
In this paper, we extend the ideas of graph pebbling to oriented graphs and find a classification for all graphs with fully traversable pebbling assignments that are isomorphic to their assignment graph. We then give some cases in which a graph with
Externí odkaz:
http://arxiv.org/abs/2111.04882
Autor:
Mildred Koch Garrison
Publikováno v:
The Psychiatric Quarterly. 17:11-17
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a4ff2552124301afa825bb14aea619a
https://doi.org/10.1007/bf01744159
https://doi.org/10.1007/bf01744159
Autor:
Mildred Koch Garrison
Publikováno v:
The Psychiatric Quarterly. 15:251-254
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00a3867b5f8a60df028f9e3665fd6468
https://doi.org/10.1007/bf01573074
https://doi.org/10.1007/bf01573074