Efficient Location of Resources in Cylindrical Networks

The location of resources in a network satisfying some optimization property is a classical combinatorial problem that can be modeled and solved by using graphs. Key tools in this problem are the domination-type properties, which have been defined and widely studied in different types of graph models, such as undirected and directed graphs, finite and infinite graphs, simple graphs and hypergraphs. When the required optimization property is that every node of the network must have access to exactly one node with the desired resource, the appropriate models are the efficient dominating sets. However, the existence of these vertex sets is not guaranteed in every graph, so relaxing some conditions is necessary to ensure the existence of some kind of dominating sets, as efficient as possible, in a larger number of graphs. In this paper, we study independent [1, 2]-sets, a generalization of efficient dominating sets defined by Chellali et al., in the case of cylindrical networks. It is known that efficient dominating sets exist in very special cases of cylinders, but the particular symmetry of these graphs will allow us to provide regular patterns that guarantee the existence of independent [1, 2]-sets in every cylinder, except in one single case, and to compute exact values of the optimal parameter, the independent [1, 2]-number, in cylinders of selected sizes.


Introduction
Graphs have been used, since their informal beginnings, as a model to represent complex networks, to describe different properties within them and to find solutions to diverse problems, such as optimal routes or the best location of resources.Formally, a finite graph is a pair G = (V, E), where V is a non-empty finite set, whose elements are called vertices, and E ⊆ V × V is a set of unordered pairs of vertices called edges.If uv is an edge, we say that u and v are neighbors.The distance between two vertices u and v in a graph is the number of edges in a shortest path connecting them and it is denoted by d (u, v).The open neighborhood of a vertex u in a graph G is N(u) = {v ∈ V(G) : uv ∈ E(G)} and the closed neighborhood is N[u] = N(u) ∪ {u}.The degree of a vertex is the cardinality of its open neighborhood.Domination-type properties in graphs, formally defined in the late 1950s [1] and early 1960s [2], are a good example of how these models can help to represent real world problems and to provide optimal solutions to them.A dominating set in a graph G is a vertex set S such that every vertex not in S has at least one neighbor in S.This classical definition provides a model of resource location in a network, in such a way that every node of the network has access to such a resource.Once this model is formulated, it is an immediate question to find the best possible distribution, which results in the definition of the domination number γ(G) of a graph G, which is the minimum cardinality of a dominating set of G.An extensive compilation of results on this subject can be found in [3], as well as some of its applications such as the planning of school bus routes, the design of computer communication networks, the location of broadcasting stations, social networks modeling and land surveying.
Following this classic pattern, a large number of variants have been defined, which pay attention to different aspects.For instance, k-domination requests at least k neighbors in S for the vertices not in the k-dominating set S and locating-domination asks for N(u) ∩ S = N(v) ∩ S for every pair of vertices u, v ∈ V(G) \ S. Another interesting variation consists of considering dominating sets with additional properties, such as connectedness or independence.A vertex set is connected if every two vertices in it can be joined by a sequence of edges consisting of vertices in the set.This model is useful to distribute resources in a network that need to be connected to each other.The opposite point of view is independence.A vertex set is independent if no pair of vertices in it are neighbors.Independent dominating sets have been widely studied, as they provide a model of resource location in cases where such resources should be placed far away from each other.
The most precise way to dominate a graph is the so-called efficient domination.A vertex set S is an efficient dominating set [4], or perfect code [5,6], if S is independent and every vertex not in S has a unique neighbor in S. The idea behind this definition is keeping the domination of each vertex to the minimum, so that vertices in S are dominated just by themselves, and vertices not in S are dominated just once by vertices in S. Clearly, this definition provides a desirable form of domination, which becomes even more interesting with the repeatedly rediscovered result that ensures every efficient dominating set is a minimum dominating set [3].However, the main problem with efficient dominating sets is that their existence is not guaranteed in every graph.There are well-known graph families that have no efficient dominating sets and, in these cases, a number of relaxations of conditions are possible in order to obtain a dominating set as efficient as possible.In this paper, we focus on one of these relaxed forms, called independent [1,2]-sets and defined in [7].The lower level of requirement of these sets consists of allowing at most two neighbors in the set, for vertices not in it, while keeping independence.Although existence is not guaranteed either in this case, the lesser requirement leads one to think that the family of graphs that possess such sets is larger than in the case of efficient domination.The independent [1,2]-number of a graph G was also defined in [7] as the minimum cardinality of an independent [1,2]-set, if such sets exist in G, and it is denoted by i [1,2] (G).The following general relationship among the three mentioned domination parameters can easily be deduced from definitions.Every graph G satisfies the first inequality, while the last one is true for graphs admitting an independent [1,2] Given two graphs, G and H, the Cartesian product of them is the graph G2H with vertex set V(G2H) = V(G) × V(H) and edge set defined as follows: Cartesian product graphs play an interesting role in the domination-type properties, due in part to the well-known Vizing's Conjecture [8], which states γ(G2H) ≥ γ(G)γ(H) for every two graphs G and H.It was formulated in 1968 and is still open.
We study the particular case of cylindrical networks C m 2P n , which are the Cartesian product of a cycle C m and a path P n , and our interest comes from the known fact that they have no efficient dominating set, except in one particular case [9].On the other hand, studying the existence of independent [1,2]-sets in cylinders was proposed as an open problem in [7].Unlike in the case of grids P m 2P n , the Cartesian product of two paths, where the domination number is completely computed [10], the domination number of the cylinder is unknown in the general case, while formulas for γ(C m 2P n ) have recently been obtained for m ≤ 11 [11] and m ≤ 30 [12].This makes cylinders a graph family of interest for domination-type properties, in which there is still much to study.
The rest of the paper is organized as follows.In Section 2, we prove that all cylinders have an independent [1,2]-set, except the single case of the Cartesian product of the cycle with 5 vertices and the path with 2 vertices, which has no such set.We use the symmetry of the cylindrical graphs to provide regular models of independent [1,2]-sets that, in addition, will give an upper bound for the independent [1,2]-number.We will also prove that this upper bound is indeed the exact value, in some small cases.In Section 3, we present a modification of a dynamic programming algorithm, originally developed for computing the domination number of grids, to provide information about the independent [1,2]-number in cylinders of selected sizes.Depending on the size of the cylinder, this modified algorithm computes the exact value of the parameter or just an upper bound for it.In the latter case we combine these results with an appropriate lower bound, in order to obtain the desired exact value.Finally, in Sections 4 and 5 we present and discuss the experimental results obtained with the above mentioned algorithm.All graphs that appear in this paper are finite, simple and undirected.For undefined general concepts of graph theory, we refer to [13].

Dominating a Cylinder as Efficiently as Possible
We devote this section to studying the existence of independent [1,2]-sets in cylinders of any size.As we mentioned before, a cylinder C m 2P n is the Cartesian product of a cycle C m with m ≥ 3 vertices and a path P n with n ≥ 2 vertices.We will not consider the smallest case C m 2P 1 = C m because all vertices in a cycle have degree two, so that every independent dominating set is trivially an independent [1,2]-set.
We present some regular patterns that provide independent [1,2]-sets in every cylinder, except in the case C 5 2P 2 , where no such sets exist.The key point of this graph family is the particular symmetry of cylinders, which allows one to replicate small pieces in order to cover the whole graph.
The interest in obtaining independent [1,2]-sets in cylinders lies in the known fact that just a particular case of them have an efficient dominating set, as we recall in the following proposition.Proposition 1. [9] The cylinder C m 2P n has an efficient dominating set if and only if m ≡ 0 (mod 4) and n = 2.
We begin our study about the behaviour of independent [1,2]-sets in cylinders proving that C 5 2P 2 has no such sets.This will eventually be the unique case of a cylinder failing this property.
and suppose on the contrary that S ⊆ V(C 5 2P 2 ) is an independent [1,2]-set.Suppose that there exist at least two vertices in S sharing the second coordinate.By the symmetry of the graph, we may assume that (u i , 1), (u j , 1) ∈ S.
We now focus on the rest of the cylinders with n = 2, where we provide an example of an independent [1,2]-set in each size and we also obtain the exact value of the independent [1,2]-number.Proposition 3. Let m ≥ 3 be an integer.Then, the cylinder C m 2P 2 has an independent [1,2]-set if and only if m = 5.Moreover, Proof.By Proposition 2, we know that C 5 2P 2 has no independent [1,2]-set.It is shown in [14] For every integer m = 5 we will construct an independent [1,2]-set, with i(C m 2P 2 ) vertices, so we will obtain that i If m ≡ 0 (mod 4), then m = 4r ≥ 4 and consider the set of black vertices in Figure 2a.The basic block can be repeated r times to obtain an independent [1,2]  If 5 < m ≡ 1 (mod 4), then m = 4r + 1 ≥ 9 and r ≥ 2. We repeat the basic block r − 2 times, add the tail block and the rest (see Figure 2b for the case r = 2, m = 9 and Figure 2c for the general case r ≥ 3).We obtain an independent [1,2]-set S (black vertices) with 2(r − 2) vertices.If m ≡ 2 (mod 4), then m = 4r + 2 ≥ 6 and r ≥ 1.We add r − 1 copies of the basic block, the tail block for this case and the appropriate rest (see Figure 2d for the case r = 1, m = 6 and Figure 2e for the general case r ≥ 2) and we obtain an independent [1,2]-set with 2(r − 1) If m ≡ 3 (mod 4), then m = 4r + 3 ≥ 3 and r ≥ 0. We construct the independent [1,2]-set by adding r copies of the basic block to the rest for this size, as is shown in Figure 2f if r = 0, m = 3 and in Figure 2g if r ≥ 1.We obtain an independent [1,2]-set with 2r vertices.Once we have proven the existence of an independent [1,2]-set in C m 2P 2 (m = 5), with size i(C m 2P 2 ), the desired equality now comes from Equation (1).[11].In these cases, no efficient dominating set exists and Proposition 3 shows that minimum independent [1,2]-sets play a similar role to such sets, in the sense that they provide the most efficient way of dominating these cylinders and they are at the same time minimum dominating sets.
In the same way, we obtained the value of i [1,2] in the case n is as small as possible, we now study the case with the smallest cycle, that is C 3 2P n .Here, we also supply an example of an independent [1,2]-set that proves to be minimum.Henceforth, we will say that C m 2P n has m rows and n columns.Each row is a path with n vertices and each column is a cycle with m vertices.We numerate rows from top to bottom and we numerate columns from left to right.
Proof.We just need to prove that C 3 2P n has an independent [1,2]-set with i(C 3 2P n ) elements.In Figure 3, we show a regular pattern for such a set, for any value of n.Clearly, this set has n elements, one in each column, so i for the last equality see [14]).Remark 2. We would like to point out that the value of the domination number of cylinder C 3 2P n that appears in [12], 4 otherwise, and it can be found in [11].In Figure 4a, we show a minimum dominating set of C 3 2P 8 with 24  4 + 1 = 7 vertices and, in Figure 4b, a dominating set of C 3 2P 9 with 27 4 = 7 vertices.None of them are independent sets; indeed, Once we have studied the cases with the smallest values of m and n, we now focus on the general case.Our target is to prove that every cylinder C m 2P n , with m ≥ 4 and n ≥ 3 has an independent [1,2]-set.To this end we construct regular patterns that can be replicated in order to cover all the cases.These patterns will also provide an upper bound of i [1,2] .We think that it could be possible to separately study some other small cases, for instance m = 4 or m = 5, to obtain the exact values of the independent [1,2]-number.However, we now prefer to provide general constructions, even if they are not minimum ones, that can be used in cylinders of any size, in order to prove the general existence of independent [1,2]-sets.On the other hand, we will compute the exact value of i [1,2] for a number of small cases in the following sections.We divide our study into two results, one for odd paths and another for even paths.We begin with the odd case.
Theorem 1.Let m ≥ 4 be an integer and let n ≥ 3 be an odd integer.Then the cylinder C m 2P n has an independent [1,2]-set.Moreover in this case Proof.
Using n = 2k + 1 ≥ 3, consider the pattern described in Figure 5, where set S consists of black vertices.There are no vertices of S in the even columns.Regarding odd columns, we begin with vertices in odd positions in the first one and then we alternate with vertices in even positions.Clearly S is an independent [1,2]-set in C 2r 2P 2k+1 .Moreover, in each odd column there are r vertices of S, so Case 2: m = 2r + 1 ≥ 5 and n = 4k + 1 ≥ 5.
Consider the pattern described in Figure 6.Here, we use a basic block with four columns, which we repeat k times, and a rest with one column.
In the basic block, vertices in S in the first column are in even positions, in the second column the unique vertex in S is the last one.In the third column, vertices in S are the ones in the odd positions, except the first and the last ones.Finally, in column number four, we pick just the first vertex.Therefore, there are r + 1 + (r − 1) + 1 = 2r + 1 vertices of S in each basic block (see Figure 6).
We now take the pattern in Figure 7. Again, we repeat the same basic block as before k times, and we add a rest with three columns.If k = 0 and n = 3, we just consider the rest with three columns.In any case, the resulting set S is an independent [1,2]-set of C 2r+1 2P 4k+3 .We know that a basic block contains 2r + 1 vertices of S and note that the rest contains r + 1 + r vertices of S, therefore We now complete the study of the existence of independent [1,2]-sets in cylinders with the following theorem, covering the remaining case, that is, when n is even.Theorem 2. Let m ≥ 4 be an integer and let n ≥ 4 be an even integer.Then, the cylinder C m 2P n has an independent [1,2]-set.Moreover, in this case, Proof.
We consider here the pattern described in Figure 8 that provides an independent [1,2]-set S, in C 3r 2P n .Note that each column contains r vertices of S, so Case 2: m = 3r + 1 ≥ 4.
To describe the pattern we use here, we begin with a single column.Vertices in S in such a column are those in positions a multiple of three plus one, except the vertex in position m = 3r + 1, so the column contains r vertices in S. We call the vertex in position one in the column the mark vertex, and, by construction, the mark vertex belongs to S (see Figure 9a, mark vertex with a square).We repeat this distribution of vertices in S in the second column, but rotating the cycle in such a way that the mark vertex is in the position two units smaller (modulo m) (see Figure 9b, the arrow shows rotation).The set S is an independent [1,2]-set in this pair of columns.Consider now a new pair of columns with the distribution of vertices in S described above.We join it to the preceding pair, and, in this case, we rotate the cycles so that the mark vertex is in position one unit larger (modulo m) (see Figure 9c, the arrows show rotations).Again, we obtain an independent [1,2]-set in the resulting cylinder.Repeating this operation as many times as necessary, we obtain an independent [1,2]-set S in C 3r+1 2P 2k (see Figure 9d, the arrows show rotations).
We show in Figure 9 an example with ten rows, but the construction also works for smaller cases (four and seven rows), and for bigger cases.Regarding the cardinality of S, note that there are r vertices of S in each column, so We begin here with two types of columns.In Type A columns, vertices in S are in positions multiple of three plus one, except in position 3m + 1; in addition we include vertex in position 3m (see Figure 10a).We call the vertex in position one in the column the Type A mark vertex, and, by construction, this vertex belongs to S. Note that there are r + 1 vertices of S in type A columns.In Type B columns, vertices in S are in positions multiple of three plus one, except in position 3m + 1.We do not add any other vertex here (see Figure 10b).We call the vertex in position one in the column the Type B mark vertex, which belongs to S. In a Type B column there are r vertices in S.
Rules to join both types of columns, in order to obtain the desired independent [1,2]-set, are the following.We first need a four-column block, of types A, B, B and A (in this order), where each column is rotated, in reference to the previous one, until placing mark vertices as shown in Figure 10c.Note that vertices in S in this block are an independent [1,2]-set in the block.
We now make a two-column block by placing a Type B column and a Type A column (in this order), in such a way that mark vertices are in positions shown in Figure 10d.
We place a two-column block after another block (with four or two columns), rotating the second block in such a way that its mark vertex is in positions shown in Figure 10e,f.
The desired independent [1,2]-set S is obtained with one initial four-column block and attaching to it as many two-column blocks as necessary, to obtain the cylinder C m 2P 2k (note that 2k ≥ 4) (see Figure 11).Note that, although vertices in S in a two-column block are not a dominating set by themselves, as can be seen in Figure 10d, when we attach such a block to one four-column block following the rotation rules as described above, we obtain an independent [1,2]-set S (see Figure 10e).After this first operation, adding a new two-column block keeps independent [1,2]-domination (see Figure 11).We show in this figure the case m = 11, but the same pattern works with smaller cases m = 5 and m = 8, and also with larger ones.The four-column block contains two type A and two type B columns, so there are 2(r + 1) + 2r = 4r + 2 vertices of S in the block.On the other hand, two-column blocks consist of one type A and one type B column, so they have (r + 1) + r = 2r + 1 vertices in S. Finally, S contains one four-column block and k − 2 two-column blocks, so:

Computing the Independent [1, 2]-Number in Cylinders
Having proven that every cylinder, except C 5 2P 2 , has an independent [1,2]-set, in this section, we present an algorithm to compute the independent [1,2]-number in cylinders of small sizes.This is an adaptation of the algorithm presented in [15], to compute the domination number of grids.A modified version of this algorithm also appears in [16,17].Although the steps of the algorithm are quite similar to the original one, we prefer to completely described it, in order to fix notation and to point out the differences.We focus on cylinders C m 2P n with m ≥ 4, because the case m = 3 was solved in Proposition 4.
The main tool of the algorithm is the (min, +) matrix multiplication.This is the standard matrix multiplication for the semi-ring of tropical numbers in the min convention (see [18]), that is, the usual multiplication is replaced by sum, whereas the usual sum is replaced by minimization.Therefore, the (min, +) product of an m × n matrix A and an n × p matrix B is computed by the formula (A B) i,j = min 1≤k≤n (a i,k + b k,j ).Moreover, the (min, +) product of a matrix A and a scalar c is computed by (c A) i,j = c + a i,j .
The other key point of the algorithm is the identification of columns of the cylinder with words in the alphabet {0, 1, 2, 3}, in such a way that the number in each vertex describes its behaviour regarding independent [1,2]-domination.We next describe how we will do this.Let C m 2P n be a cylinder and let S ⊆ V(C m 2P n ) be an independent [1,2]-set.We identify each vertex u with an element of the set {0, 1, 2, 3}, following these rules: u = 0 if u ∈ S; u = 1 if u has exactly one neighbor in S in its column or in the previous one; u = 2 if u has exactly two neighbors in S in its column or in the previous one; u = 3 if u has no neighbors in S in its column or in the previous one.
By definition, each vertex equal to 2 has at least one neighbor in S in its column and each vertex equal to 3 has a unique neighbor in S, which is in the following column.Every vertex in the cylinder is in exactly one of the preceding situations, so all of them can be identified with a unique number.Therefore each column can be seen as a word of length m in the alphabet {0, 1, 2, 3}, where the first and last letters are consecutive, because columns in the cylinder C m 2P n are cycles with m vertices.The property of set S being an independent [1,2]-set provides a number of restrictions in words that can appear, which we list below.In all the restrictions, we consider that the first and last letters of the word P(≡ column) are consecutive, because each column is a cycle.If P is a word associated to an independent [ Note that any sequence of List (a) in a column implies that in the column, or in the previous one, or in the following one, there are two consecutive vertices of S, so it is not possible.Sequences in list (b) are not allowed because of the rules for associating each vertex with its number.Finally, sequences of list (c) do not appear in any column because each vertex has at most two neighbors in S and in all cases, such a sequence implies that in the previous column there is a vertex (next to the zero) with three neighbors in S. A word of length m in the alphabet {0, 1, 2, 3} not containing any of the sequences in Lists (a), (b) and (c) is called a correct word.
We also need to bear in mind that the first and last columns of the cylinder play a different role than interior ones, because they are placed next to a unique column, not between two columns.A word in the first column satisfies that every vertex equal to 1 has a neighbor in the column (just one) equal to 0, and every vertex equal to 2 has both neighbors in the column equal to 0. A correct word satisfying these conditions is called an initial word.On the other hand, the word in the last column does not contain any vertex equal to 3 and we call correct words satisfying this property final words.
Some restrictions regarding rows also arise.They can be described with rules that describe where a column P can be placed in the following position of column Q.In order to collect these restrictions, we denote letters in words P and Q as P = p 1 p 2 . . .p m and Q = q 1 q 2 . . .q m and in the following cases, indices are taken modulo m, (i) if q i = 0, then either p i = 2 and {p i−1 = 0 or p i+1 = 0, but not both are non-zero} or p i = 1 and p i−1 = 0 and p i+1 = 0 ; (ii) if q i = 1, then either p i = 0 or p i = 1 and {p i−1 = 0 or p i+1 = 0, but not both are non-zero} or p i = 2 and p i−1 = 0 and p i+1 = 0 or p i = 3; (iii) if q i = 2, then either p i = 1 and {p i−1 = 0 or p i+1 = 0, but not both are non-zero} or p i = 3; (iv) if q i = 3, then p i = 0.
If words P and Q satisfy Conditions (i) to (iv), we say that P can follow Q.Clearly, each independent [1,2]-set in the cylinder C m 2P n can be identified with a unique ordered list P 1 , P 2 , . . ., P n , of n correct words of length m in the alphabet {0, 1, 2, 3}, such that 1. P 1 is initial; 2. P i+1 can follow P i , for i ∈ {1, 2, . . .n − 1}; 3. P n is final.
We denote such ordered lists as (m, n)-lists.An ordered list satisfying properties 1 and 2 is called an (m, n)-quasilist.
To compute the independent [1,2]-number of C m 2P n , that is, the minimum number of zeros among all (m, n)-lists, we define the following vector.Denote by c m the cardinality of the set {P 1 , P 2 , . . ., P c m } of correct words of length m.The vector X 1 = (α 1 , α 2 , . . ., α c m ), of length c m , is defined as follows: We also define the matrix A c m ×c m = (a i,j ), a square matrix of size c m such that a i,j = number of zeros of P i if P i can follow P j , +∞ otherwise.
By multiplying vector X 1 and matrix A, with the (min, +) matrix multiplication, we obtain a new vector X 2 = A X 1 = (β 1 , β 2 , . . ., β c m ), and, clearly, every finite entry represents the minimum number of zeros among all (m, 2)-quasilists having P i as its second word.We can repeat this process as many times as we need, so if X n = A X (n−1) = (δ 1 , δ 2 , . . ., δ c m ), then every finite entry δ i < +∞, represents the minimum number of zeros among all (m, n)-quasilists having P i as its last word.Having in mind that an (m, n)-quasilist whose last word is final is an (m, n)-list, we obtain Moreover, algebraic properties of (min, +) matrix multiplication give the following result, which is similar to Theorem 2.2 of [16].
Proposition 5. Let m ≥ 3 be an integer and suppose that there exist n 0 , c, d > 0 such that X n 0 +d = c X n 0 .Then X n+d = c X n for every n ≥ n 0 , and moreover Proof.We prove by induction that X n+d = c X n for every n ≥ n 0 .On the one hand, X n 0 +d = c X n 0 by hypothesis.Assume now that X (n−1)+d = c X (n−1) for n − 1 ≥ n 0 .Then, properties of the (min, +) matrix algebra and the inductive hypothesis give In particular, i is finite if and only if δ i is finite.Finally this gives Results presented in this section provide the following algorithm to compute the independent [1,2]-number of C m 2P n .It is an adaptation of the algorithm presented in [15], to compute the domination number of grids.A modified version of this algorithm also appears in [16,17].On the one hand, the algorithm computes the value of i [1,2] (C m P n ) for fixed and small enough (m, n).On the other hand, given a fixed m, it computes a list of vectors X 1 , X 2 , . . ., X r and it tries to find the recurrence relationship on the hypothesis of Proposition 5.
If a recurrence is found by Algorithm 1, Proposition 5 provides a finite difference equation with d boundary values i [1,2] (C m P s ), for n 0 ≤ s ≤ n 0 + d − 1.The solution of this equation is where the value of β depends on the boundary values.Remaining values of i [1,2] (C m P n ), that is for 2 ≤ n ≤ n 0 − 1, have also been computed by the algorithm, so finding the recurrence means that the independent [1,2]-number of C m 2P n is completely computed.
Algorithm 1: Recurrence for the Independent [1,2]-number in Cylinders Input: integers m ≥ 4 and r ≥ 2 or NO RECURRENCE FOUND 1 compute the ordered set of all correct words on length m; 2 compute vector X 1 ; 3 compute matrix A; 4 use (min, +) matrix multiplication to obtain X 2 , X 3 , . . ., X r ; 5 if (X n 0 +d = c X n 0 for some n 0 , d, c==True) then However, the existence of such a recurrence relationship is not guaranteed, as was mentioned in Section 6 of [15].Some sufficient conditions on an arbitrary matrix A, in the (min, +) matrix algebra, are known that ensure such a recurrence exists.We recall the following definition from [15].A matrix A is irreducible if there exists an integer K such that for every k ≥ K, matrix A k has no infinite entries, and this is analogous to the definition of irreducible matrix in regular matrix algebra.Theorem 6.3 of [15] states that, if A is an irreducible matrix, then the recurrence needed to apply Proposition 5 occurs.
The following characterization is well known; see, for instance, [19].Considering matrix A as the adjacency matrix of a directed graph (there is an arc from j to i if and only if a i,j < +∞), A is irreducible if and only if such a directed graph is strongly connected.In particular, a matrix such that every entry in the i th row is equal to +∞ is not irreducible, because no arc arrives to i.When this situation happens, the recurrence needed in Proposition 5 could not occur.This is the main difference between the computation of the independent [1,2]-number in cylinders and the previous cases where this algorithm has been used (see [15][16][17]).In our case, matrices defined using the properties of independent [1,2]-sets have an increasing number of rows with no finite entry, when m gets larger.In fact, we just found the desired recurrence in cases m = 4 and m = 5.If m ≥ 6 our strategy consists of modifying the first step of the algorithm.We consider a reduced collection C of correct words instead of having all of them, so we obtain an auxiliary parameter f m (n) that represents the minimum number of zeros among all (m, n)-lists with words in C, if there exists at least one of such (m, n)-list.Then, we use the algorithm to look for the recurrence relationship, but using just correct words in subset C and, in the case it is found, the auxiliary function obtained satisfies The final step consists of combining this upper bound with an appropriate lower bound, in order to localize the independent [1,2]-number in an interval as small as possible.

Experimental Results
In this section, we present the results obtained with Algorithm 1, for values of m between 4 and 15.The link to the source code, in programming language C, to perform all the operations described in the algorithm can be found in the Supplementary Materials.Notice that vector X 1 is computed using its definition, but vectors X 2 , X 3 , . . ., X r are obtained by successively multiplying matrix A and vector X 1 , with the (min, +) matrix multiplication.We do this operation by means of an adaptation of the CSPARSE library [20].This library provides a fast method for multiplying sparse matrices with the usual product, and we have adapted it for the (min, +) matrix product.Therefore, we have obtained a library that efficiently multiplies sparse matrices, also with this product, as can be seen in Table 1, where we show that execution times for computing the first 100 vectors are shorter than times for the computation of the matrix.We have also included computation times for the set of correct words, but not for vector X 1 , because it is less that one second in all cases.In both cases, we have found the recurrence needed to apply Proposition 5, and we have completely computed the independent [1,2]-number of cylinders C m 2P n , for n ≥ 2. Data obtained with Algorithm 1 and finite difference equations appear in Table 2.
The solution of the finite difference equation gives the formula of the independent [1,2]-number.In both cases, the independent [1,2]-number agrees with the domination number (see [12]); therefore, independent [1,2]-sets provide the most efficient way to dominate these cylinders.

Cases 6 ≤ m ≤ 10
In these cases, matrices obtained with the algorithm have a large number of rows with all entries equal to +∞, so they are not irreducible.This means the recurrence is not guaranteed and, in fact, we have not found it in the first 100 vectors.Clearly, it could happen that the recurrence relationship exists for some n 0 ≥ 100, but instead of keeping on looking for a recurrence in larger values, we prefer a different approach.
We remove a group of correct words and we use Algorithm 1 again, but considering the remaining word subset instead of the complete list of correct words computed in step 1.The criterion for removing words takes into account formulas for the independent domination number i(C m 2P n ) = cn+β d obtained in [14], and we look for similar formulas for the independent [1,2]-number.We fixed vector X 20 because it is small enough to quickly use the algorithm and it gives positive results in cases we are considering.For each m, we take the integer d in formula i(C m 2P n ) = cn+β d and we study the pair of vectors X 20 , X 20+d .Their entries in the i th position, X 20 (i), X 20+d (i), are in one of the following situations: 1. both are infinite; 2. both are finite, then we compute the difference X 20+d (i) − X 20 (i); 3. one of them is finite and the other one is infinite, then we say that they are non-comparable.
If a recurrence is not found, then either there are non-comparable pairs or differences of finite entries are not equal, or both.In Table 3, we show values of differences found and if there are non-comparable words.Recall that, for each m, the set of correct words {P 1 , P 2 , . . ., P c m } is ordered and it has c m elements, and the size of vector X n is c m .We now take the integer c in i(C m 2P n ) = cn+β d and we keep the word in position i if both i th entries are finite with X 20+d (i) − X 20 (i) = c and also in case X 20+d (i) = X 20 (i) = +∞.However, we remove the word in position i if entries are finite with X 20+d (i) − X 20 (i) = c or X 20+d (i), X 20 (i) are non-comparable.This strategy provides a subset C of correct words that we use in the algorithm, instead of the complete list originally computed in the first step.In cases 6 ≤ m ≤ 9, we found the recurrence, as we expected.However, in case m = 10, after a first selection of words, recurrence does not appear and we remove a second group of words, with the same criterion.It is shown in Table 3, in rows 10-I and 10-II.After removing the second word group, a recurrence also appears for m = 10.We now apply Algorithm 1, but using the subset C of remaining words instead of the complete list.We would like to point out that there exists an (m, n)-list with words in C if and only if the value of f m (n) = min{δ i : P i ∈ C is a final word} is finite, where X n = A n X 1 = (δ 1 , . . ., δ k ), X 1 is the initial vector, A is the matrix, both associated to subset C of correct words of length m, and |C| = k.Clearly, if this auxiliary function f m (n) is finite, then it provides the minimum number of zeros among all (m, n)-lists with words in C, so it is trivially true that i [1,2] (C m 2P n ) ≤ f m (n).Moreover, if we just consider words in C and the recurrence relationships described in Proposition 5 occurs, then the finitude of boundary values ensures that f m (n) is finite, for every n ≥ n 0 .
Recurrences and boundary values found by Algorithm 1, when we just use the subset C of correct words described in Table 3, are shown in Table 4.
The solutions of auxiliary equations are the following: As we mentioned before, f m (n) is an upper bound of the independent [1,2]-number of C m 2P n , and we now combine these results with the values of i(C m 2P n ) [14], which is a natural lower bound, that is In cases m = 6, 7, 9, 10 and also in case m = 8, n ≡ 0, 1, 3 (mod 5), we obtained f m (n) = i(C m 2P n ), so the independent [1,2]-number agrees with the independent domination number.In case m = 8 and n ≥ 12, n ≡ 2, 4 (mod 5), we obtained f m (n) = i(C m 2P n ) + 1; the bounds do not agree and we can just conclude that i We computed the independent [1,2]-number for 12 ≤ n ≤ 100, n ≡ 2, 4 (mod 5) and it agrees with the upper bound in all cases.
We also computed the independent [1,2]-number of small cylinders (n ≤ n 0 − 1) with the algorithm, by using Equation (2) with the complete list of correct words.We include these values in the final formulas. .In these cases, the independent domination number is not known, so our first task is to compute it.We will use these values as a lower bound of the independent [1,2]-number.To this end we have implemented the algorithm described in [16], to compute the independent domination number of the grid P m 2P n , making the necessary changes to adapt it to the cylinder C m 2P n .These changes just consist of considering that the first and the last letters in each word are neighbors.Computations can be done following the same steps as in Algorithm 1, but taking into account the rules to define correct words and to compute vector X 1 and matrix A that correspond with the definition of independent domination.For the sake of completeness, we recall these rules from [16].For an independent dominating set S of C m 2P n , each vertex u ∈ V(C m 2P n ) is identified with an element of the set {0, 1, 2}, following these rules: u = 0 if u ∈ S; u = 1 if u has at least one neighbor in S, in its column or in the previous one; u = 2 if u has no neighbors in S, in its column or in the previous one.
Each column in C m 2P n can be seen as a word of length m in the alphabet {0, 1, 2}, where the first and last letters are consecutive.Correct words are those words not containing the sequences 00, 22, 1111, 1112, 2111, 2112.For a pair of correct words P, Q, we say that P = p 1 p 2 . . .p m can follow Q = q 1 q 2 . . .q m if they satisfy the following conditions (i) if q i = 0, then p i = 1, (ii) if q i = 1, then either p i = 0 or p i = 1 and {p i−1 = 0 or p i+1 = 0, } or p i = 2, (iii) if q i = 2, then p i = 0.
Following the same steps as in Algorithm 1 with the rules described above, recurrence is found for 11 ≤ m ≤ 15 and we present the final formulas obtained (we have not included small cases not following the general formula).
We now follow the same strategy as in the preceding cases and we use vectors X 50 , X 50+d because they provide positive results in all cases.For m = 11, 12, 13, 15, the first reduction of the correct words gives positive results and we found the recurrence.However, in case m = 14, after a first selection of words, a recurrence does not appear and we remove a second group of words, with the same criterion.After removing the second word group, a recurrence also appears in this case.We show the rules for reducing the correct word set in Table 5.In Table 6, we show recurrences and finite difference equations in each case.otherwise.
Final formulas have been obtained by comparing auxiliary equations with the above computed independent domination number and by using inequalities i( We also include values for small cylinders, with n ≤ n 0 − 1.In the case m = 13, we also include values of i [1,2] (C 13 2P n ) for n ≤ 100, n ≡ 0, 2 (mod 7).if n ≥ 8.

Figure 9 .
Figure 9. Construction of a regular pattern for an independent [1, 2]-set in C 3r+1 2P 2k : (a) first column; (b) a pair of columns; (c) two pairs of columns; (d) k pairs of columns.
1, 2]-set S, then P does not contain any of the following sequences:

Table 2 .
Recurrence values for reduced sets of correct words.

Table 3 .
Criteria for removing some correct words.

Table 4 .
Recurrence values for reduced sets of correct words.

Table 5 .
Criteria for removing some correct words.

Table 6 .
Recurrence values for reduced sets of correct words.