Zobrazeno 1 - 10
of 11
pro vyhledávání: '"James Tuite"'
Autor:
Maya Thankachy, Ullas Chandran S.V., James Tuite, Elias Thomas, Gabriele Di Stefano, Grahame Erskine
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 3, p 1169 (2024)
Externí odkaz:
https://doaj.org/article/9ed252b2fb414a2e9ce94c1d14663d8f
Let G be a graph. Assume that to each vertex of a set of vertices $S\subseteq V(G)$ a robot is assigned. At each stage one robot can move to a neighbouring vertex. Then S is a mobile general position set of G if there exists a sequence of moves of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1cafc44969454325aecaad122e3522e7
http://arxiv.org/abs/2209.12631
http://arxiv.org/abs/2209.12631
Autor:
Maya Thankachy, Ullas Chandran S.V., James Tuite, Elias Thomas, Gabriele Di Stefano, Grahame Erskine
In this paper we generalise the notion of visibility from a point in an integer lattice to the setting of graph theory. For a vertex $x$ of a connected graph $G$, we say that a set $S \subseteq V(G)$ is an \emph{$x$-position set} if for any $y \in S$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf6b8c02e7b3c135c070d3e81bdbc408
http://arxiv.org/abs/2209.00359
http://arxiv.org/abs/2209.00359
Autor:
Grahame Erskine, James Tuite
The search for the smallest possible $d$-regular graph of girth $g$ has a long history, and is usually known as the cage problem. This problem has a natural extension to hypergraphs, where we may ask for the smallest number of vertices in a $d$-regul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::714b9cfef08ca876be813597ae848ab3
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030950170
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bcdc37da51269971dd326aace567edb
https://doi.org/10.1007/978-3-030-95018-7_4
https://doi.org/10.1007/978-3-030-95018-7_4
A digraph G is k-geodetic if for any pair of (not necessarily distinct) vertices $$u,v \in V(G)$$ u , v ∈ V ( G ) there is at most one walk of length $$\le k$$ ≤ k from u to v in G. In this paper, we determine the largest possible size of a k-geo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::767b1f4554c3c1503feed782f4d269ff
Autor:
Grahame Erskine, James Tuite
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
We study a generalisation of the degree/girth problem to the setting of directed and mixed graphs. We say that a mixed graph or digraph G is k-geodetic if there is no pair of vertices u, v such that G contains distinct non-backtracking walks of lengt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8cb7cabd8a623d140c39381cfaecf26
https://doi.org/10.1007/978-3-030-83823-2_124
https://doi.org/10.1007/978-3-030-83823-2_124
The general position problem in graph theory asks for the largest set $S$ of vertices of a graph $G$ such that no shortest path of $G$ contains more than two vertices of $S$. In this paper we consider a variant of the general position problem called
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e41805ff225b15115cdfc0a810dd144
http://arxiv.org/abs/2012.10330
http://arxiv.org/abs/2012.10330
Publikováno v:
The CASE Journal. 14:593-603
Synopsis The case describes the dilemma a young leader, First Lieutenant Toomey, faces after arriving at a new organization. Toomey’s subordinate (sergeant first class Rodgers) is more experienced and accomplished and has enjoyed a degree of autono
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afce38bb30a2fe60a537608aca9994ff
https://doi.org/10.1108/tcj-02-2018-0032
https://doi.org/10.1108/tcj-02-2018-0032
Autor:
James Tuite, Grahame Erskine
The undirected degree/diameter and degree/girth problems and their directed analogues have been studied for many decades in the search for efficient network topologies. Recently such questions have received much attention in the setting of mixed grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2101ed30e937b305e75f8b28eace5311
http://oro.open.ac.uk/67892/8/PDF_67892.pdf
http://oro.open.ac.uk/67892/8/PDF_67892.pdf