Exploració per autor "Maureso Sánchez, Montserrat"
Ara es mostren els items 6-16 de 16
-
Dimensión métrica y dimensión métrica tolerante en grafos MOP.
Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2023)
Text en actes de congrés
Accés obertEn este trabajo estudiamos la dimensión métrica y la dimensión métrica tolerante en grafos periplanos maximales. Concretamente, damos cotas ajustadas de ambos parámetros y caracterizamos los grafos que alcanzan las cotas ... -
Extreme weights in Steinhaus triangles
Brunat Blay, Josep M.; Maureso Sánchez, Montserrat (2016-09-08)
Article
Accés obertLet {0=w0<w1<w2<…<wm0=w0<w1<w2<…<wm} be the set of weights of binary Steinhaus triangles of size n , and let Wibe the set of sequences in F2n that generate triangles of weight wi. In this paper we obtain the values of wi ... -
Location in maximal outerplanar graphs
Claverol Aguas, Mercè; García, Alfredo; Hernández, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel, Javier (2017)
Text en actes de congrés
Accés restringit per política de l'editorialIn this work we study the metric dimension and the location-domination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal ... -
Metric dimension of maximal outerplanar graphs
Claverol Aguas, Mercè; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè (2021-02-02)
Article
Accés obertIn this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if ß(G) denotes the metric dimension of a maximal outerplanar graph G of order n, we prove that 2=ß(G)=¿2n5¿ and that the ... -
Metric dimension of maximal outerplanar graphs
Claverol Aguas, Mercè; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Hernández Peñalver, Gregorio; Garcia Olaverri, Alfredo Martin; Tejel, Javier (2019-03-28)
Report de recerca
Accés obert -
Paired and semipaired domination in near-triangulations
Hernando Martín, María del Carmen; Claverol Aguas, Mercè; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2022-07-22)
Report de recerca
Accés obertA 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 subgraph induced by its vertices has a perfect matching, ... -
Rotational and dihedral symmetries in Steinhaus and Pascal binary triangles
Brunat Blay, Josep Maria; Maureso Sánchez, Montserrat (2010)
Text en actes de congrés
Accés obertWe give explicit formulae for obtaining the binary sequences which produce Steinhaus triangles and generalized Pascal triangles with rotational and dihedral symmetries. -
Symmetries in Steinhaus triangles and in generalized Pascal triangles
Brunat Blay, Josep Maria; Maureso Sánchez, Montserrat (2011)
Article
Accés restringit per política de l'editorialWe give explicit formulae for obtaining the binary sequences which produce Steinhaus triangles and generalized Pascal triangles with rotational and dihedral symmetries. -
Taller. Pissarres Digitals
Alsina Aubach, Montserrat; Maureso Sánchez, Montserrat; Carmona Mejías, Ángeles (2020-06-30)
Audiovisual
Accés obertVolem donar una visió molt pròxima de l'ús de les pissarres digitals en la docència no presencial. Es parlarà i practicarà sobre l'ús dels diferents suports: pissarres cegues, tauletes (Ipad, android) i ordinador convertible ... -
Total domination in plane triangulations
Claverol Aguas, Mercè; Garcia Olaverri, Alfredo Martin; Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2020-11-09)
Report de recerca
Accés obert -
Total domination in plane triangulations
Claverol Aguas, Mercè; Garcia Olaverri, Alfredo Martin; Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2021-01-01)
Article
Accés obertA total dominating set of a graph is a subset of such that every vertex in is adjacent to at least one vertex in . The total domination number of , denoted by , is the minimum cardinality of a total dominating set of . A ...