Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Novick, Beth"'
We investigate how the metric dimension of infinite graphs change when we add edges to the graph. Our two main results: (1) there exists a growing sequence of graphs (under the subgraph relation, but without adding vertices) for which the metric dime
Externí odkaz:
http://arxiv.org/abs/2205.06889
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
For a graph $G$ and $a,b\in V(G)$, the shortest path reconfiguration graph of $G$ with respect to $a$ and $b$ is denoted by $S(G,a,b)$. The vertex set of $S(G,a,b)$ is the set of all shortest paths between $a$ and $b$ in $G$. Two vertices in $V(S(G,a
Externí odkaz:
http://arxiv.org/abs/1705.09385
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)
Publikováno v:
In Mathematical Social Sciences January 2021 109:164-174
Moser asked for a construction of explicit tournaments on $n$ vertices having at least $(\frac{n}{3e})^n$ Hamilton cycles. We show that he could have asked for rather more.
Externí odkaz:
http://arxiv.org/abs/1506.00699
Publikováno v:
In Discrete Applied Mathematics 10 July 2016 207:15-28
Autor:
Mulder, Henry Martyn, Novick, Beth
Publikováno v:
In Discrete Applied Mathematics April 2013 161(6):838-846
Autor:
Jamison, Robert E., Novick, Beth
Publikováno v:
In Discrete Mathematics 2008 308(20):4544-4550
Autor:
Gao, Shuhong1 sgao@ces.clemson.edu, Novick, Beth1 nbeth@ces.clemson.edu
Publikováno v:
Annals of Combinatorics. 2007, Vol. 11 Issue 2, p161-171. 11p.