메뉴 건너뛰기




Volumn 85, Issue 2, 2002, Pages 297-306

On the density of identifying codes in the square lattice

Author keywords

Density; Graph; Identifying code; Square lattice

Indexed keywords


EID: 0036315421     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2001.2106     Document Type: Article
Times cited : (31)

References (15)
  • 7
    • 0002284758 scopus 로고    scopus 로고
    • On identifying codes
    • (A. Barg and S. Litsyn, Eds.), Providence "DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Proceedings of the DIMACS Workshop on Codes and Association Schemes"
    • (2001) Amer. Math. Soc , pp. 97-109
    • Cohen, G.1    Honkala, I.2    Lobstein, A.3    Zémor, G.4
  • 8
    • 85031460709 scopus 로고    scopus 로고
    • Computational results on identifying t-codes, preprint
    • Exoo, G.1
  • 15
    • 0001026535 scopus 로고
    • Locating dominating sets and locating-dominating sets
    • (Y. Alavi and A. Schwenk, Eds.), Wiley, New York "Graph Theory, Combinatorics, and Applications, Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs"
    • (1995) , vol.2 , pp. 1073-1079
    • Slater, P.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.