173 search results - page 2 / 35 » On a New Class of Codes for Identifying Vertices in Graphs |
COMBINATORICS
2002
13 years 5 months ago
2002
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...
EJC
2008
13 years 4 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...