Add to ORKGThe study of vertex identifying codes is grounded in graph theory and has applications in the design of multiprocessor networks. Roughly speaking, a vertex identifying code is a way of labeling the vertices of a graph. We are particularly interested in infinite graphs, e.g., the square, triangular and hexagonal grids
Abstract. An identifying code C is a subset of the vertices of the square grid Z 2 with the property...
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
AbstractDetermining a malfunctioning component in a processor network gives the motivation for locat...
Given a graph G, an identifying code D subset of V(G) is a vertex set such that for any two distinct...
For a graph, G, and a vertex v ∈ V (G), let N [v] be the set of vertices adjacent to and including v...
In this thesis we study Identifying Code Problem in triangular grids and king grids both infinite. W...
International audienceAn identifying code in a graph G is a subset of vertices with the property tha...
International audienceLet G be a graph G. The neighborhood of a vertex v in G, denoted by N (v), is ...
The identifying code problem was introduced in 1998 by Karpovsky as a way to help fault diagnosis in...
Discharging arguments demonstrate a connection between local structure and global averages. This mak...
International audienceA set C ⊆ V (G) is an identifying code in a graph G if for all v ∈ V (G), C[v]...
An identifying code in a graph $G$ is a subset of vertices with the property that for each vertex $v...
A permutation may be characterized as b-banded when it moves no element more than b places. Every pe...
Assume that G = (V, E) is an undirected graph, and C subset of V. For every v is an element of V, we...
AbstractAn identifying code of a graph G is a dominating set C such that every vertex x of G is dist...
Abstract. An identifying code C is a subset of the vertices of the square grid Z 2 with the property...
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
AbstractDetermining a malfunctioning component in a processor network gives the motivation for locat...
Given a graph G, an identifying code D subset of V(G) is a vertex set such that for any two distinct...
For a graph, G, and a vertex v ∈ V (G), let N [v] be the set of vertices adjacent to and including v...
In this thesis we study Identifying Code Problem in triangular grids and king grids both infinite. W...
International audienceAn identifying code in a graph G is a subset of vertices with the property tha...
International audienceLet G be a graph G. The neighborhood of a vertex v in G, denoted by N (v), is ...
The identifying code problem was introduced in 1998 by Karpovsky as a way to help fault diagnosis in...
Discharging arguments demonstrate a connection between local structure and global averages. This mak...
International audienceA set C ⊆ V (G) is an identifying code in a graph G if for all v ∈ V (G), C[v]...
An identifying code in a graph $G$ is a subset of vertices with the property that for each vertex $v...
A permutation may be characterized as b-banded when it moves no element more than b places. Every pe...
Assume that G = (V, E) is an undirected graph, and C subset of V. For every v is an element of V, we...
AbstractAn identifying code of a graph G is a dominating set C such that every vertex x of G is dist...
Abstract. An identifying code C is a subset of the vertices of the square grid Z 2 with the property...
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
AbstractDetermining a malfunctioning component in a processor network gives the motivation for locat...