AbstractWe show that every nonstable graph (possibly infinite) with bounded degree admits a set V⧹{x} as an identifying code. We know some infinite graphs for which only its vertex set itself is an identifying code, but these graphs have only vertices of infinite degree
An identifying code of a graph is a dominating set which uniquely determines all the vertices by the...
Assume that G = (V, E) is an undirected and connected graph, and consider C subset of V. For every v...
International audienceAn identifying code of a graph is a subset of its vertices such that every ver...
AbstractWe show that every nonstable graph (possibly infinite) with bounded degree admits a set V⧹{x...
AbstractAn identifying code of a graph G is a dominating set C such that every vertex x of G is dist...
Master of ScienceDepartment of MathematicsSarah ReznikoffA (1, ≤ 2)-identifying code is a subset of...
International audienceIn an undirected graph $G$, a subset $C\subseteq V(G)$ such that $C$ is a domi...
AbstractLet G be a graph and B(u) be the set of u with all of its neighbors in G. A set S of vertice...
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
A (1, ≤ 2)-identifying code is a subset of the vertex set C of a graph such that each pair of vertic...
AbstractAn identifying code of a graph is a subset of vertices C such that the sets B(v)∩C are all n...
AbstractIdentifying codes were defined to model fault diagnosis in multiprocessor systems. They are ...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r⩾1;...
In this thesis, we study problems on vertices identification of graphs. To identify the vertices of ...
In an undirected graph G, a subset C ⊆ V (G) such that C is a dominating set of G, and each vertex i...
An identifying code of a graph is a dominating set which uniquely determines all the vertices by the...
Assume that G = (V, E) is an undirected and connected graph, and consider C subset of V. For every v...
International audienceAn identifying code of a graph is a subset of its vertices such that every ver...
AbstractWe show that every nonstable graph (possibly infinite) with bounded degree admits a set V⧹{x...
AbstractAn identifying code of a graph G is a dominating set C such that every vertex x of G is dist...
Master of ScienceDepartment of MathematicsSarah ReznikoffA (1, ≤ 2)-identifying code is a subset of...
International audienceIn an undirected graph $G$, a subset $C\subseteq V(G)$ such that $C$ is a domi...
AbstractLet G be a graph and B(u) be the set of u with all of its neighbors in G. A set S of vertice...
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
A (1, ≤ 2)-identifying code is a subset of the vertex set C of a graph such that each pair of vertic...
AbstractAn identifying code of a graph is a subset of vertices C such that the sets B(v)∩C are all n...
AbstractIdentifying codes were defined to model fault diagnosis in multiprocessor systems. They are ...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r⩾1;...
In this thesis, we study problems on vertices identification of graphs. To identify the vertices of ...
In an undirected graph G, a subset C ⊆ V (G) such that C is a dominating set of G, and each vertex i...
An identifying code of a graph is a dominating set which uniquely determines all the vertices by the...
Assume that G = (V, E) is an undirected and connected graph, and consider C subset of V. For every v...
International audienceAn identifying code of a graph is a subset of its vertices such that every ver...
DOI
Add to ORKG