On Identifying Codes in the King Grid that are Robust Against Edge Deletions

On identifying codes that are robust against edge changes

Assume that G = (V ,E) is an undirected graph, and C ⊆ V . For every v ∈ V , denote Ir(G; v) = {u ∈ C : d(u, v) ≤ r}, where d(u, v) denotes the number of edges on any shortest path from u to v in G. If all the sets Ir(G; v) for v ∈ V are pairwise different, and none of them is the empty set, the codeC is called r-identifying. Themotivation for identifying codes comes, for instance, from finding...

On 2-edge robust r-identifying codes in the king grid

An improved lower bound for (1, ≤ 2)-identifying codes in the king grid

We call a subset C of vertices of a graph G a (1,≤ l)-identifying code if for all subsets X of vertices with size at most l, the sets {c ∈ C|∃u ∈ X, d(u, c) ≤ 1} are distinct. The concept of identifying codes was introduced in 1998 by Karpovsky, Chakrabarty and Levitin. Identifying codes have been studied in various grids. In particular, it has been shown that there exists a (1,≤ 2)-identifying...

An improved lower bound for (1,

We call a subset C of vertices of a graph G a (1,≤ l)-identifying code if for all subsets X of vertices with size at most l, the sets {c ∈ C|∃u ∈ X, d(u, c) ≤ 1} are distinct. The concept of identifying codes was introduced in 1998 by Karpovsky, Chakrabarty and Levitin. Identifying codes have been studied in various grids. In particular, it has been shown that there exists a (1,≤ 2)-identifying...

Design of A Single-Phase Transformerless Grid-Connected PV Inverter ‎Considering Reduced Leakage Current and LVRT Grid Codes

A new single-phase transformerless grid-connected PV inverter is presented in this paper. Investigations in transformerless grid-connected PV inverters indicate the existence of the leakage current is directly related to the variable common-mode voltage (CMV), which is presented in detail. On the other hand, in recent years it has become mandatory for the transformerless grid-connected PV inver...