Zobrazeno 1 - 10
of 87
pro vyhledávání: '"Gologranc Tanja"'
Autor:
Brešar Boštjan, Bujtás Csilla, Gologranc Tanja, Klavžar Sandi, Košmrlj Gašper, Marc Tilen, Patkós Balázs, Tuza Zsolt, vizer Máté
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 1, Pp 225-247 (2021)
A longest sequence (v1, . . ., vk) of vertices of a graph G is a Grundy total dominating sequence of G if for all i, N(υj)\∪j=1i-1N(υj)≠∅N({\upsilon _j})\backslash \bigcup\nolimits_{j = 1}^{i - 1} {N({\upsilon _j})} \ne \emptyset . The length
Externí odkaz:
https://doaj.org/article/7354b0e5988e4cd6b60942146d69c9ca
Autor:
Gologranc Tanja
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 1, Pp 137-150 (2014)
Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227-240] as a generalization of median graphs. We present some incorrectnesses from t
Externí odkaz:
https://doaj.org/article/4766a45ab3344c1497e614404cf163fb
Autor:
Gologranc, Tanja, Taranenko, Andrej
Daisy graphs of a rooted graph $G$ with the root $r$ were recently introduced as a generalization of daisy cubes, a class of isometric subgraphs of hypercubes. In this paper we first solve the problem posed in \cite{Taranenko2020} and characterize ro
Externí odkaz:
http://arxiv.org/abs/2005.13320
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:
Brešar, Boštjan, Bujtás, Csilla, Gologranc, Tanja, Klavžar, Sandi, Košmrlj, Gašper, Marc, Tilen, Patkós, Balázs, Tuza, Zsolt, Vizer, Máté
Domination game [SIAM J.\ Discrete Math.\ 24 (2010) 979--991] and total domination game [Graphs Combin.\ 31 (2015) 1453--1462] are by now well established games played on graphs by two players, named Dominator and Staller. In this paper, Z-domination
Externí odkaz:
http://arxiv.org/abs/1807.02695
Autor:
Gologranc, Tanja, Repolusk, Polona
A tolled walk $T$ between two non-adjacent vertices $u$ and $v$ in a graph $G$ is a walk, in which $u$ is adjacent only to the second vertex of $T$ and $v$ is adjacent only to the second-to-last vertex of $T$. A toll interval between $u,v\in V(G)$ is
Externí odkaz:
http://arxiv.org/abs/1801.08043
Autor:
Brešar, Boštjan, Bujtás, Csilla, Gologranc, Tanja, Klavžar, Sandi, Košmrlj, Gašper, Marc, Tilen, Patkós, Balázs, Tuza, Zsolt, Vizer, Máté
A longest sequence $(v_1,\ldots,v_k)$ of vertices of a graph $G$ is a Grundy total dominating sequence of $G$ if for all $i$, $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\emptyset$. The length $k$ of the sequence is called the Grundy total domina
Externí odkaz:
http://arxiv.org/abs/1712.08780
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
Autor:
Brešar, Boštjan, Bujtás, Csilla, Gologranc, Tanja, Klavžar, Sandi, Košmrlj, Gašper, Patkós, Balázs, Tuza, Zsolt, Vizer, Máté
In a graph $G$ a sequence $v_1,v_2,\dots,v_m$ of vertices is Grundy dominating if for all $2\le i \le m$ we have $N[v_i]\not\subseteq \cup_{j=1}^{i-1}N[v_j]$ and is Grundy total dominating if for all $2\le i \le m$ we have $N(v_i)\not\subseteq \cup_{
Externí odkaz:
http://arxiv.org/abs/1702.00828
Autor:
Gologranc, Tanja, Repolusk, Polona
Toll convexity is a variation of the so-called interval convexity. A tolled walk $T$ between $u$ and $v$ in $G$ is a walk of the form $T: u,w_1,\ldots,w_k,v,$ where $k\ge 1$, in which $w_1$ is the only neighbor of $u$ in $T$ and $w_k$ is the only nei
Externí odkaz:
http://arxiv.org/abs/1608.07390