Now showing items 1-20 of 64

    • Aprendizaje colaborativo en base a problemas mediante el uso del foro electrónico 

      Buenestado Caballero, Pablo; Minelli de Oliveira, Janaina; Moragas Gascons, Lluís; Rodríguez Pérez, Ana Carmen; Cañadas Lorenzo, Juan Carlos; Pelayo Melero, Ignacio Manuel (2012-06-15)
      Part of book or chapter of book
      Open Access
      La incorporación de las plataformas digitales en la educación impulsa nuevas maneras de aprender. La universidad promueve la participación sincrónica y asincrónica entre sujetos que no están en el mismo lugar, ni al mismo ...
    • Aula virtual de soporte a la docencia y al autoaprendizaje del cálculo para estudiantes universitarios con material docente y aplicaciones basadas en software libre 

      Jarauta Bragulat, Eusebio; Pelayo Melero, Ignacio Manuel (2012-06-15)
      Part of book or chapter of book
      Open Access
    • Boundary-type sets and product operators in graphs 

      Cáceres, Jose; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz (2010)
      Conference lecture
      Open Access
    • Coloración de grafos por vecindades diferentes. 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Alcom, Liliana; Gutierrez, Marisa (2017-07-07)
      Part of book or chapter of book
      Restricted access - publisher's policy
      En este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ...
    • Confección y gestión automática de exámenes tipo test 

      Cañadas Lorenzo, Juan Carlos; Diego Vives, José Antonio; Pelayo Melero, Ignacio Manuel (Universidad de Cádiz, 2016)
      Conference lecture
      Restricted access - publisher's policy
      El presente trabajo describe la implementación de una aplicación informática como recurso docente, diseñada como plataforma para la elaboración, utilización y corrección de controles formativos y exámenes de evaluación. ...
    • Creació de qüestionaris des de l'entorn moodle per a assignatures de matemàtiques i estadística corresponents a primers cursos de titulacións d'enginyeria 

      Ginovart Gisbert, Marta; Blanco Abellán, Mónica; Jarauta Bragulat, Eusebio; Pelayo Melero, Ignacio Manuel; Estela Carbonell, M. Rosa; Fabregat Fillet, Jaume; Portell Canal, Xavier; Ferrer Closas, Pol (Universitat Politècnica de Catalunya. Institut de Ciències de l'Educació, 2010-02-11)
      Conference lecture / Conference report
      Open Access
      La finalitat del projecte ha estat el disseny i la implementació d’un banc de 1345 preguntes, que permeten generar col•leccions de qüestionaris, utilitzant les prestacions que ofereix l’entorn Moodle. L’àmbit d’aplicació ...
    • Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-10-16)
      External research report
      Open Access
      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 ...
    • Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs 

      Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz (2018-04-20)
      Article
      Open Access
      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 ...
    • Extremal graph theory for metric dimension and diameter 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos; Wood, David (2010)
      Article
      Open Access
    • Feedforwarding : Plan, desarrollo y evaluación de un caso mediante el uso de campus virtual 

      Fabregat Fillet, Jaume; Pelayo Melero, Ignacio Manuel (2016)
      Part of book or chapter of book
      Open Access
      La población de estudiantes puede ver los espacios de evaluación más como calificadores/clasificadores que como formativos; en numerosos contextos no se trata exclusivamente de una perspectiva, de “su” perspectiva personal, ...
    • General bounds on limited broadcast domination 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (Chapman & Hall/CRC, 2018-10-26)
      Article
      Open Access
      Dominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as a common framework for both broadcast and ...
    • General bounds on limited broadcast domination 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz; Cáceres, José (2016-09-19)
      External research report
      Open Access
      Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating ...
    • Generalizing the krein-milman property in graph convexity spaces: a short survey 

      Pelayo Melero, Ignacio Manuel (2006)
      Conference lecture
      Restricted access - publisher's policy
    • Global location-domination in graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2013-12-03)
      External research report
      Open Access
      A dominating set S of a graph G is called locating-dominating, LD-setfor short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ...
    • LD-graphs and global location-domination in bipartite graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014-09-02)
      Article
      Restricted access - publisher's policy
      A dominating set S of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S . Locating-dominating sets of minimum ...
    • LD-graphs and global location-domination in bipartite graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014)
      Conference report
      Open Access
      A dominating setS of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ...
    • Limited broadcast domination: upper bounds and complexity 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-07-07)
      Part of book or chapter of book
      Restricted access - publisher's policy
      En este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ...
    • Locating domination in bipartite graphs and their complements 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2018-01-01)
      Article
      Restricted access - publisher's policy
      A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ...
    • Locating domination in bipartite graphs and their complements 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
      External research report
      Open Access
      A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ...