Ara es mostren els items 11-16 de 16

    • 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 obert
      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, ...
    • 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 obert
      We 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'editorial
      We 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 obert
      Volem 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 obert
      A 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 ...