Results 21 to 30 of about 269,190 (213)
General $d$-position sets [PDF]
, 2020 The general $d$-position number ${\rm gp}_d(G)$ of a graph $G$ is the cardinality of a largest set $S$ for which no three distinct vertices from $S$ lie on a common geodesic of length at most $d$.
Klavzar, Sandi +2 more
core +2 more sources
Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Answer Set Programming (ASP) is a famous logic language for knowledge representation, which has been really successful in the last years, as witnessed by the great interest into the development of efficient solvers for ASP.
Marco De Bortoli
doaj +1 more source
Enumerating Minimal Solution Sets for Metric Graph Problems [PDF]
Algorithmica, 2023 Problems from metric graph theory like Metric Dimension, Geodetic Set, and Strong Metric Dimension have recently had an impact in parameterized complexity by being the first known problems in NP to admit double-exponential lower bounds in the treewidth ...
Benjamin Bergougnoux +2 more
semanticscholar +1 more source
A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs [PDF]
, 2014 The \emph{zero forcing number}, $Z(G)$, of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)-S$ are colored white) such that $V(G)$ is turned black after finitely many applications of "the color-change rule":
A Sebö +19 more
core +1 more source
Strong resolving graph of the intersection graph in commutative rings
, 2023 The intersection graph of ideals associated with a commutative unitary ring $R$ is the graph $G(R)$ whose vertices all non-trivial ideals of $R$ and there exists an edge between distinct vertices if and only if the intersection of them is non-zero. In this paper, the structure of the resolving graph of $G(R)$ is characterized and as an application, we ...
Dodongeh, E. +2 more
openaire +2 more sources
On the Metric Dimension of Cartesian Products of Graphs [PDF]
, 2005 A set S of vertices in a graph G resolves G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G.
Brigham R. C. +27 more
core +5 more sources
On 1-movable Strong Resolving Hop Domination in Graphs
European Journal of Pure and Applied Mathematics, 2023 A set S is a 1-movable strong resolving hop dominating set of G if for every v ∈ S, either S\{v} is a strong resolving hop dominating set or there exists a vertex u ∈ (V (G)\S)∩NG(v) such that (S \ {v}) ∩ {u} is a strong resolving hop dominating set of G.
Armalene Abragan, Helen M. Rara
openaire +1 more source
3/2 Firefighters are not enough [PDF]
, 2010 The firefighter problem is a monotone dynamic process in graphs that can be viewed as modeling the use of a limited supply of vaccinations to stop the spread of an epidemic.
Berlekamp +16 more
core +1 more source
Resolving sets for Johnson and Kneser graphs [PDF]
, 2012 A set of vertices $S$ in a graph $G$ is a {\em resolving set} for $G$ if, for any two vertices $u,v$, there exists $x\in S$ such that the distances $d(u,x) \neq d(v,x)$.
Alberto Márquez +37 more
core +2 more sources
On the strong metric dimension of the strong products of graphs
Open Mathematics, 2015 Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exists some shortest u-w path containing v or some shortest v-w path containing u.
Kuziak Dorota +2 more
doaj +1 more source