Special Issue: 'Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography' ACA 2019, Montreal, Canada, July 16–20, 2019

Autor: Ilias S. Kotsireas, Qiang Wang, Teo Mora, Iiro S. Honkala, Kenza Guenda

Publikováno v: Applicable Algebra in Engineering, Communication and Computing. 31:171-172

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8add11659d5e05f5302031ef84295bdc
https://doi.org/10.1007/s00200-020-00436-w

On the ensemble of optimal identifying codes in a twin-free graph

Autor: Antoine Lobstein, Iiro S. Honkala, Olivier Hudry

Publikováno v: Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, 2016, 8, pp.139-153

Let G = (V, E) be a graph. For v ? V and r ? 1, we denote by BG,r(v) the ball of radius r and centre v. A set C⊆V$C \subseteq V$ is said to be an r-identifying code if the sets BG,r(v)?C$B_{G,r}(v)\cap C$, v ? V, are all nonempty and distinct. A gr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed98ef6a82b9c0676acc56f9618e6c06
https://doi.org/10.1007/s12095-015-0148-3

On the ensemble of optimal dominating and locating-dominating codes in a graph

Autor: Antoine Lobstein, Olivier Hudry, Iiro S. Honkala

Publikováno v: Information Processing Letters
Information Processing Letters, 2015, 115, pp.699-702

Let G be a simple, undirected graph with vertex set V. For every v � V , we denote by N ( v ) the set of neighbours of v, and let N v ] = N ( v ) � { v } . A set C � V is said to be a dominating code in G if the sets N v ] � C , v � V , are

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43b87fafb1a871f8057ab81a20c1515e
https://doi.org/10.1016/j.ipl.2015.04.005

Watching Systems in the King Grid

Autor: David Auger, Iiro S. Honkala

Publikováno v: Graphs and Combinatorics. 29:333-347

We consider the infinite King grid where we investigate properties of watching systems, an extension of the notion of identifying code recently introduced by Auger et al. (Discret. Appl. Math., 2011). The latter were extensively studied in the infini

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7100b1ea22e3940d5f5531d396920e13
https://doi.org/10.1007/s00373-011-1124-0

On r-locating–dominating sets in paths

Autor: Iiro S. Honkala

Publikováno v: European Journal of Combinatorics. 30:1022-1025

Assume that G=(V,E) is a simple undirected graph, and C is a nonempty subset of V. For every v∈V, we define Ir(v)={u∈C∣dG(u,v)≤r}, where dG(u,v) denotes the number of edges on any shortest path between u and v. If the sets Ir(v) for v∉C are

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45476393a1458e7345ab6dfcf3b23308
https://doi.org/10.1016/j.ejc.2008.04.011