Next Article in Journal
A Critical Note on Symmetry Contact Artifacts and the Evaluation of the Quality of Homology Models
Next Article in Special Issue
Graph Theory
Previous Article in Journal
Suitability of a Consensual Fuzzy Inference System to Evaluate Suppliers of Strategic Products
Previous Article in Special Issue
Analyzing Spatial Behavior of Backcountry Skiers in Mountain Protected Areas Combining GPS Tracking and Graph Theory
Article Menu
Issue 1 (January) cover image

Export Article

Open AccessArticle
Symmetry 2018, 10(1), 24;

Efficient Location of Resources in Cylindrical Networks

Department of Applied Mathematics for Information and Communication Technologies, Universidad Politécnica de Madrid, Calle Alan Turing s\n, 28031 Madrid, Spain
Department of Computer Science, Universidad de Almería, Carretera Sacramento s\n, 04120 Almería, Spain
Department of Mathematics, Universidad de Almería, Carretera Sacramento s\n, 04120 Almería, Spain
Author to whom correspondence should be addressed.
Received: 4 December 2017 / Revised: 4 January 2018 / Accepted: 8 January 2018 / Published: 10 January 2018
(This article belongs to the Special Issue Graph Theory)
Full-Text   |   PDF [905 KB, uploaded 12 January 2018]   |  


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. View Full-Text
Keywords: cartesian product of graphs; efficient domination; tropical matrix algebra cartesian product of graphs; efficient domination; tropical matrix algebra

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Carreño, J.J.; Martínez, J.A.; Puertas, M.L. Efficient Location of Resources in Cylindrical Networks. Symmetry 2018, 10, 24.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top