An aperiodic tiles machine

The results we introduce in this work lead to get an algorithm which produces aperiodic sets of tiles using Voronoi diagrams. This algorithm runs in optimal worst-case time O(nlogn). Since a wide range of new examples can be obtained, it could shed some new light on non-periodic tilings. These examples are locally isomorphic and exhibit the 5-fold symmetry which appears in Penrose tilings and quasicrystals. Moreover, we outline a similar construction using Delaunay triangulations and propose some related open problems

Steiner distance and convexity in graphs

We use the Steiner distance to define a convexity in the vertex set of a graph, which has a nice behavior in the well-known class of HHD-free graphs. For this graph class, we prove that any Steiner tree of a vertex set is included into the geodesical convex hull of the set, which extends the well-known fact that the Euclidean convex hull contains at least one Steiner tree for any planar point set. We also characterize the graph class where Steiner convexity becomes a convex geometry, and provide a vertex set that allows us to rebuild any convex set, using convex hull operation, in any graph

Graph operations and Lie algebras

This paper deals with several operations on graphs and combinatorial structures linking them with their associated Lie algebras. More concretely, our main goal is to obtain some criteria to determine when there exists a Lie algebra associated with a combinatorial structure arising from those operations. Additionally, we show an algorithmic method for one of those operations.Ministerio de Ciencia e InnovaciónFondo Europeo de Desarrollo Regiona

Towards a new framework for domination

Dominating concepts constitute a cornerstone in Graph Theory. Part of the efforts in the field have been focused in finding different mathematical frameworks where domination notions naturally arise, providing new points of view about the matter. In this paper, we introduce one of these frameworks based in convexity. The main idea consists of defining a convexity in a graph, already used in image processing, for which the usual parameters of convexity are closely related to domination parameters. Moreover, the Helly number of this convexity may be viewed as a new domination parameter whose study would be of interest

Rebuilding convex sets in graphs

The usual distance between pairs of vertices in a graph naturally gives rise to the notion of an interval between a pair of vertices in a graph. This in turn allows us to extend the notions of convex sets, convex hull, and extreme points in Euclidean space to the vertex set of a graph. The extreme vertices of a graph are known to be precisely the simplicial vertices, i.e., the vertices whose neighborhoods are complete graphs. It is known that the class of graphs with the Minkowski–Krein–Milman property, i.e., the property that every convex set is the convex hull of its extreme points, is precisely the class of chordal graphs without induced 3-fans. We define a vertex to be a contour vertex if the eccentricity of every neighbor is at most as large as that of the vertex. In this paper we show that every convex set of vertices in a graph is the convex hull of the collection of its contour vertices. We characterize those graphs for which every convex set has the property that its contour vertices coincide with its extreme points. A set of vertices in a graph is a geodetic set if the union of the intervals between pairs of vertices in the set, taken over all pairs in the set, is the entire vertex set. We show that the contour vertices in distance hereditary graphs form a geodetic set

Dilation-free graphs in the l1 metric

The dilation-free graph of a planar point set S is a graph that spans S in such a way that the distance between two points in the graph is no longer than their planar distance. Metrically speaking, those graphs are equivalent to complete graphs; however they have far fewer edges when considering the Manhattan distance (we give here an upper bound on the number of saved edges). This article provides several theoretical, algorithmic, and complexity features of dilation-free graphs in the l1-metric, giving several construction algorithms and proving some of their properties. Moreover, special attention is paid to the planar case due to its applications in the design of printed circuit boards

Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs

Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the associated parameter, the dominating 2-broadcast number. We prove that computing the dominating 2-broadcast number is a NP-complete problem, but can be achieved in linear time for trees. We also give an upper bound for this parameter, that is tight for graphs as large as desired.Peer ReviewedPostprint (author's final draft

The determining number of Kneser graphs

A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G is the minimum cardinality of a determining set of G. This paper studies the determining number of Kneser graphs. First, we compute the determining number of a wide range of Kneser graphs, concretely Kn:k with n≥k(k+1) / 2+1. In the language of group theory, these computations provide exact values for the base size of the symmetric group Sn acting on the k-subsets of {1,…, n}. Then, we establish for which Kneser graphs Kn:k the determining number is equal to n-k, answering a question posed by Boutin. Finally, we find all Kneser graphs with fixed determining number 5, extending the study developed by Boutin for determining number 2, 3 or 4

Seasonal and vertical dynamics in the trophic structure of a temperate zooplankton assemblage

We determined the stable nitrogen isotope composition (δ15N values) and body size of taxonomic groups in a zooplankton community in the Cantabrian Sea (southern Bay of Biscay) to explore seasonal and depth (0–2000 m) variations in the size‐based trophic structure and their coupling to the production cycle. The positive linear relationship between δ15N values and log‐transformed body size reflects the dominance of new vs. regenerated production. The slope of the relationship (b) is high during productive periods and low when herbivory declines and the food web is more dependent on recycled production. This variation can be attributed to high δ15N values of the smallest plankton after repetitive cycles of microbial degradation. Downward transport of organic matter after the spring phytoplankton bloom was captured by a steady variation from low values of b at the surface to high values at the bathypelagic zone, where the imprint of the spring production pulse could be detected. Variation in b reveals that the mesopelagic and bathypelagic zooplankton communities are as dynamic as their epipelagic counterparts. This shows the efficiency of δ15N vs. body size relationships to capture fast, transient ecosystem processes without need for lengthy incubations or complex rate measurements