Related papers: Progress on the localization number of a graph
Graphs are a powerful way to model interactions and relationships in data from a wide variety of application domains. In this setting, entities represented by vertices at the "center" of the graph are often more important than those…
The deduction game is a variation of the game of cops and robber on graphs in which searchers must capture an invisible evader in at most one move. Searchers know each others' initial locations, but can only communicate if they are on the…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $S\subseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial. In this paper, we provide some improved upper and lower bounds…
We study a game of pursuit and evasion introduced by Seager in 2012, in which a cop searches the robber from outside the graph, using distance queries. A graph on which the cop wins is called locatable. In her original paper, Seager asked…
In this paper, we study a graph parameter that was recently introduced, the burning number, focusing on a few probabilistic aspects of the problem. The original burning number is revisited and analyzed for binomial random graphs G(n,p),…
In this paper, we study the signed domination numbers of graphs and present new sharp lower and upper bounds for this parameter. As an example, we present a lower bound on signed domination number of trees in terms of the order, leaves and…
We improve recent results relating graph eigenvalues to other graph parameters like girth, domination number, and minimum degree.
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
We study a variant of the Localization game in which the cops have limited visibility, along with the corresponding optimization parameter, the $k$-visibility localization number $\zeta_k$, where $k$ is a non-negative integer. We give…
We consider the Robber Locating Game, where an invisible moving robber tries to evade the pursuit of one or more helicopter cops, who send distance probes from anywhere on the graph. In this paper, we attempt to propose two useful…
We introduce the game of Surrounding Cops and Robbers on a graph, as a variant of the original game of Cops and Robbers. In contrast to the original game in which the cops win by occupying the same vertex as the robber, they now win by…
Uncertainty principles present an important theoretical tool in signal processing, as they provide limits on the time-frequency concentration of a signal. In many real-world applications the signal domain has a complicated irregular…
The cop throttling number of a graph, introduced in 2018 by Breen et al., optimizes the balance between the number of cops used and the number of rounds required to catch the robber in a game of Cops and Robbers. In 2019, Cox and Sanaei…
In this paper arithmetic progressions on the integers and the integers modulo n are extended to graphs. This allows for the definition of the anti-van der Waerden number of a graph. Much of the focus of this paper is on 3-term arithmetic…
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two…
Graph neural networks (GNNs) emerge as a powerful family of representation learning models on graphs. To derive node representations, they utilize a global model that recursively aggregates information from the neighboring nodes. However,…
We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…
We introduce a variant of the Localization game in which the cops only have visibility one, along with the corresponding optimization parameter, the one-visibility localization number $\zeta_1$. By developing lower bounds using…