M. Maureso

activity

20172022

most citedTotal domination in plane triangulations

1 citations · 1 across the 4 of their papers we have counts for

collaborators

5 papers

math.CO2022

Paired and semipaired domination in triangulations

M. Claverol, C. Hernando, M. Maureso +2

A dominating set of a graph $G$ is a subset $D$ of vertices such that every vertex not in $D$ is adjacent to at least one vertex in $D$ . A dominating set $D$ is paired if the subgr…

math.CO2020★ 1 cited

Total domination in plane triangulations

M. Claverol, A. García, G. Hernández +4

A total dominating set of a graph $G = (V, E)$ is a subset $D$ of $V$ such that every vertex in $V$ is adjacent to at least one vertex in $D$ . The total domination number of $G$ , deno…

math.CO2019

Metric dimension of maximal outerplanar graphs

Mercè Claverol, Alfredo García, Greogorio Hernández +4

In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if $β (G)$ is the metric dimension of a maximal outerplanar graph $G$ of order $n$ , w…

math.CO2017

Steinhaus Triangles Generated by Vectors of the Canonical Bases

Josep M. Brunat, Montserrat Maureso

We give a method to calculate the weight of binary Steinhaus triangles generated by the vectors of the canonical basis of the vector space $F_{2}^{n}$ over the field $\mathbb{…

math.CO2017

Small and Large Weights in Steinhaus Triangles

Josep M. Brunat, Montserrat Maureso

Let ${0 = w_{0} < w_{1} < w_{2} < \dots < w_{m}}$ be the set of weights of binary Steinhaus triangles of size $n$ , and let $W_{i}$ be the set of sequences in $F_{2}^{n}$ that generate triangle…