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
Master of ScienceDepartment of MathematicsSarah ReznikoffA (1, ≤ 2)-identifying code is a subset of...
AbstractLet G=(V,E) be an undirected graph and C a subset of vertices. If the sets Br(v)∩C, v∈V (res...
AbstractLet G be a finite undirected graph with vertex set V(G). If v∈V(G), let N[v] denote the clos...
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...
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
In an undirected graph G, a subset C ⊆ V (G) such that C is a dominating set of G, and each vertex i...
Numéro spécial de la revue Discrete Mathematics dédié à la "5th Slovenian International Conference o...
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...
A (1, ≤ 2)-identifying code is a subset of the vertex set C of a graph such that each pair of vertic...
International audienceAn identifying code of a graph is a subset of its vertices such that every ver...
International audienceAn identifying code of a (di)graph $G$ is a dominating subset $C$ of the verti...
In this thesis, we study problems on vertices identification of graphs. To identify the vertices of ...
International audienceAn identifying code is a subset of vertices of a graph such that each vertex i...
An identifying code of a graph is a dominating set which uniquely determines all the vertices by the...
Master of ScienceDepartment of MathematicsSarah ReznikoffA (1, ≤ 2)-identifying code is a subset of...
AbstractLet G=(V,E) be an undirected graph and C a subset of vertices. If the sets Br(v)∩C, v∈V (res...
AbstractLet G be a finite undirected graph with vertex set V(G). If v∈V(G), let N[v] denote the clos...
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...
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
In an undirected graph G, a subset C ⊆ V (G) such that C is a dominating set of G, and each vertex i...
Numéro spécial de la revue Discrete Mathematics dédié à la "5th Slovenian International Conference o...
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...
A (1, ≤ 2)-identifying code is a subset of the vertex set C of a graph such that each pair of vertic...
International audienceAn identifying code of a graph is a subset of its vertices such that every ver...
International audienceAn identifying code of a (di)graph $G$ is a dominating subset $C$ of the verti...
In this thesis, we study problems on vertices identification of graphs. To identify the vertices of ...
International audienceAn identifying code is a subset of vertices of a graph such that each vertex i...
An identifying code of a graph is a dominating set which uniquely determines all the vertices by the...
Master of ScienceDepartment of MathematicsSarah ReznikoffA (1, ≤ 2)-identifying code is a subset of...
AbstractLet G=(V,E) be an undirected graph and C a subset of vertices. If the sets Br(v)∩C, v∈V (res...
AbstractLet G be a finite undirected graph with vertex set V(G). If v∈V(G), let N[v] denote the clos...
DOI
Add to ORKG