Search

Your search keyword '"Maureso Sánchez, Montserrat"' showing total 3 results
Start Over Author "Maureso Sánchez, Montserrat" Publication Year Range Last 3 years
3 results on '"Maureso Sánchez, Montserrat"'

1. Dimensión métrica y dimensión métrica tolerante en grafos MOP.

Author

Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. DCCG - Discrete, Combinational, and Computational Geometry, Hernández Peñalver, Gregorio, Hernando Martín, María del Carmen, Maureso Sánchez, Montserrat, Mora Giné, Mercè, Tejel Altarriba, Francisco Javier, Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. DCCG - Discrete, Combinational, and Computational Geometry, Hernández Peñalver, Gregorio, Hernando Martín, María del Carmen, Maureso Sánchez, Montserrat, Mora Giné, Mercè, and Tejel Altarriba, Francisco Javier

Abstract

En 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 inferiores., Postprint (author's final draft)

Published
2023

2. Paired and semipaired domination in near-triangulations

Author

Hernando Martín, María del Carmen, Claverol Aguas, Mercè, Maureso Sánchez, Montserrat, Mora Giné, Mercè, Tejel Altarriba, Francisco Javier, and Universitat Politècnica de Catalunya. Departament de Matemàtiques

Subjects
Graph theory, Grafs, Teoria de, Matemàtiques i estadística [Àrees temàtiques de la UPC]
Abstract

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 subgraph induced by its vertices has a perfect matching, and semipaired if every vertex in D is paired with exactly one other vertex in D that is within distance 2 from it. The paired domination number, denoted by ¿pr(G), is the minimum cardinality of a paired dominating set of G, and the semipaired domination number, denoted by ¿pr2(G), is the minimum cardinality of a semipaired dominating set of G. A near-triangulation is a biconnected planar graph that admits a plane embedding such that all of its faces are triangles except possibly the outer face. We show in this paper that ¿pr(G) = 2b n 4 c for any neartriangulation G of order n = 4, and that with some exceptions, ¿pr2(G) = b 2n 5 c for any near-triangulation G of order n = 5.

Published
2022

3. Paired and semipaired domination in near-triangulations

Author

Universitat Politècnica de Catalunya. Departament de Matemàtiques, Hernando Martín, María del Carmen, Claverol Aguas, Mercè, Maureso Sánchez, Montserrat, Mora Giné, Mercè, Tejel Altarriba, Francisco Javier, Universitat Politècnica de Catalunya. Departament de Matemàtiques, Hernando Martín, María del Carmen, Claverol Aguas, Mercè, Maureso Sánchez, Montserrat, Mora Giné, Mercè, and Tejel Altarriba, Francisco Javier

Abstract

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 subgraph induced by its vertices has a perfect matching, and semipaired if every vertex in D is paired with exactly one other vertex in D that is within distance 2 from it. The paired domination number, denoted by ¿pr(G), is the minimum cardinality of a paired dominating set of G, and the semipaired domination number, denoted by ¿pr2(G), is the minimum cardinality of a semipaired dominating set of G. A near-triangulation is a biconnected planar graph that admits a plane embedding such that all of its faces are triangles except possibly the outer face. We show in this paper that ¿pr(G) = 2b n 4 c for any neartriangulation G of order n = 4, and that with some exceptions, ¿pr2(G) = b 2n 5 c for any near-triangulation G of order n = 5., Peer Reviewed, Preprint

Published
2022

Catalog

Books, media, physical & digital resources
See catalog results