Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Benakli, Nadia"'
Autor:
Benakli, Nadia, Bong, Novi H, Dueck, Shonda M., Eroh, Linda, Novick, Beth, Oellermann, Ortrud R.
Let $G$ be a connected graph and $u,v$ and $w$ vertices of $G$. Then $w$ is said to {\em strongly resolve} $u$ and $v$, if there is either a shortest $u$-$w$ path that contains $v$ or a shortest $v$-$w$ path that contains $u$. A set $W$ of vertices o
Externí odkaz:
http://arxiv.org/abs/2008.04282
Autor:
Benakli, Nadia, Bong, Novi H., Dueck, Shonda, Eroh, Linda, Novick, Beth, Oellermann, Ortrud R.
Publikováno v:
In Discrete Mathematics July 2021 344(7)
Autor:
Kapovich, Ilya, Benakli, Nadia
We survey the known results regarding the boundaries of word-hyperbolic groups.
Comment: 63 pages
Comment: 63 pages
Externí odkaz:
http://arxiv.org/abs/math/0202286
Publikováno v:
J. Pure Appl. Algebra 156 (2001), no. 2-3, 147--151
Recently, Rips produced an example of a double of two free groups which has unsolvable generalized word problem. In this paper, we show that Rips's example fits into a large class of doubles of groups, each member of which contains F_2 x F_2 and ther
Externí odkaz:
http://arxiv.org/abs/math/9809137
Publikováno v:
International Journal of Mathematical Education in Science & Technology; Apr2017, Vol. 48 Issue 3, p393-427, 35p
Autor:
Benakli, Nadia, Glasner, Yair
Publikováno v:
Geometriae Dedicata; Feb2002, Vol. 89 Issue 1, p1-24, 24p