Zobrazeno 1 - 10
of 1 075
pro vyhledávání: '"RYAN, JOE"'
Publikováno v:
Discrete Applied Mathematics 319:424-438, 2022
We introduce a new graph-theoretic concept in the area of network monitoring. A set $M$ of vertices of a graph $G$ is a \emph{distance-edge-monitoring set} if for every edge $e$ of $G$, there is a vertex $x$ of $M$ and a vertex $y$ of $G$ such that $
Externí odkaz:
http://arxiv.org/abs/2011.00029
Autor:
Ryan, Joe
This document charts my development as an artist over the last five years on the Professional Doctorate in Fine Art at the University of East London. It begins with a reflection on the work done on B.A and M.A. in Fine Art, at Middlesex University an
Externí odkaz:
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.699613
Publikováno v:
In Discrete Applied Mathematics 15 October 2022 319:424-438
Publikováno v:
Australasian Journal of Combinatorics, 69(3), 417-441, 2017
Let $G=(V,E)$ be a connected graph and let $d(u,v)$ denote the distance between vertices $u,v \in V$. A metric basis for $G$ is a set $B\subseteq V$ of minimum cardinality such that no two vertices of $G$ have the same distances to all points of $B$.
Externí odkaz:
http://arxiv.org/abs/1702.08178
We show that the vertices and edges of a $d$-dimensional grid graph $G=(V,E)$ ($d\geqslant 2$) can be labeled with the integers from $\{1,\ldots,\lvert V\rvert\}$ and $\{1,\ldots,\lvert E\rvert\}$, respectively, in such a way that for every subgraph
Externí odkaz:
http://arxiv.org/abs/1702.02639
Publikováno v:
Combinatorial Algorithms. IWOCA 2017. Lecture Notes in Computer Science, vol 10765 (2018), 264-272
Let $G=(V,A)$ be a directed graph without parallel arcs, and let $S\subseteq V$ be a set of vertices. Let the sequence $S=S_0\subseteq S_1\subseteq S_2\subseteq\cdots$ be defined as follows: $S_1$ is obtained from $S_0$ by adding all out-neighbors of
Externí odkaz:
http://arxiv.org/abs/1612.01721
Autor:
Wijaya, Rachel Wulan Nirmalasari, Semaničová-Feňovčíková, Andrea, Ryan, Joe, Kalinowski, Thomas
Publikováno v:
Australasian Journal of Combinatorics, 69(3), 442-451, 2017
A simple graph $G=(V,E)$ admits an $H$-covering if every edge in $E$ is contained in a subgraph $H'=(V',E')$ of $G$ which is isomorphic to $H$. In this case we say that $G$ is $H$-supermagic if there is a bijection $f:V\cup E\to\{1,\ldots\lvert V\rve
Externí odkaz:
http://arxiv.org/abs/1607.07911
Publikováno v:
Journal of Combinatorial Optimization 37 (2019), 970-988
The minimum rank of a simple graph $G$ is the smallest possible rank over all symmetric real matrices $A$ whose nonzero off-diagonal entries correspond to the edges of $G$. Using the zero forcing number, we prove that the minimum rank of the butterfl
Externí odkaz:
http://arxiv.org/abs/1607.07522
We address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and then we describe and implement a computer-based method to find large c
Externí odkaz:
http://arxiv.org/abs/1503.07357