Efficient location of resources in cylindrical networks (Q1646261): Difference between revisions

Summary: 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 \textit{M. Chellali} et al. [Australas. J. Comb. 59, 144--156 (2014; Zbl 1296.05148)], 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.