Hae
Aineistot 1-1 / 1
On lower bounds of various dominating codes for locating vertices in cubic graphs
(2022-05-25)
Self-identifying codes, self-locating dominating codes and solid-locating dominating codes are three subsets of vertices of a graph G to locate vertices. The optimal size of them is denoted by γSID (G),γSLD (G) and γDLD ...