DocumentCode :
355813
Title :
On codes that can identify vertices in graphs
Author :
Cohen, G. ; Honkala, I. ; Lobstein, A. ; Zémor, G.
Author_Institution :
ENST, Paris, France
fYear :
2000
fDate :
2000
Firstpage :
11
Abstract :
In a graph G=(V,E), a subset of vertices C (=code) is called t-identifying if for all vεV the sets Bt(u)∩C consisting of all elements of C within distance t from u are nonempty and different. We study some properties of these codes
Keywords :
codes; graph theory; codes; nonempty subsets; t-identifying code; undirected connected graph; vertices identification; Binary codes; Electrons; Fault diagnosis; Lattices; Mathematics; Multiprocessing systems; Polynomials; System testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
Type :
conf
DOI :
10.1109/ISIT.2000.866301
Filename :
866301
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=355813
بازگشت