Result 1 to 20 of 115 total
Locally identifying colourings for graphs with given maximum degree. (English)
Discrete Math. 312, No. 10, 1832-1837 (2012).
1
On vertex-robust identifying codes of level three. (English)
Ars Comb. 94, 115-127 (2010).
2
An optimal strongly identifying code in the infinite triangular grid. (English)
Electron. J. Comb. 17, No. 1, Research Paper R91, 10 p., electronic only (2010).
3
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. (English)
Adv. Math. Commun. 3, No. 1, 97-114 (2009); erratum ibid. 3, No. 4, 429-430 (2009)
4
Erratum to ”edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs” (Advances in Mathematics of Communications, Vol. 3, no. 1, 2009, 97-114). (English)
Adv. Math. Commun. 3, No. 4, 429-430 (2009).
5
Weighted codes in Lee metrics. (English)
Des. Codes Cryptography 52, No. 2, 209-218 (2009).
6
On $r$-locating-dominating sets in paths. (English)
Eur. J. Comb. 30, No. 4, 1022-1025 (2009).
7
Weighted perfect codes in Lee metric (English)
Electronic Notes in Discrete Mathematics 34, 477-481 (2009).
8
On r-locating-dominating sets in paths (English)
Eur. J. Comb. 30, No. 4, 1022-1025 (2009).
9
On identifying codes in the King grid that are robust against edge deletions. (English)
Electron. J. Comb. 15, No. 1, Research Paper R3, 13 p. (2008).
10
On a new class of identifying codes in graphs. (English)
Inf. Process. Lett. 102, No. 2-3, 92-98 (2007).
11
On identifying codes that are robust against edge changes. (English)
Inf. Comput. 205, No. 7, 1078-1095 (2007).
12
Structural properties of twin-free graphs. (English)
Electron. J. Comb. 14, No. 1, Research paper R16, 15 p. (2007).
13
Structural properties of twin-free graphs (English)
Electr. J. Comb. 14, No. 1 (2007).
14
On robust and dynamic identifying codes. (English)
IEEE Trans. Inf. Theory 52, No. 2, 599-612 (2006).
15
A family of optimal identifying codes in $\Bbb Z^2$. (English)
J. Comb. Theory, Ser. A 113, No. 8, 1760-1763 (2006).
16
On 2-edge robust $r$-identifying codes in the king grid. (English)
Australas. J. Comb. 36, 151-165 (2006).
17
An optimal locating-dominating set in the infinite triangular grid. (English)
Discrete Math. 306, No. 21, 2670-2681 (2006).
18
On locating‒dominating sets in infinite grids. (English)
Eur. J. Comb. 27, No. 2, 218-227 (2006).
19
A family of optimal identifying codes in $Z^{2}$ (English)
J. Comb. Theory, Ser. A 113, No. 8, 1760-1763 (2006).
20
Result 1 to 20 of 115 total
Start
Contact
Print
General Help
