Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 50 of 167 results
  • Nordhaus-Gaddum bounds for locating domination

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel
    European journal of combinatorics
    Vol. 36, p. 1-6
    DOI: 10.1016/j.ejc.2013.04.009
    Date of publication: 2014-02-01
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    A dominating set S of graph G is called metric-locating¿dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the vertices in S. If moreover, every vertex v not in S is also uniquely determined by the set of neighbors of v belonging to S, then it is said to be locating¿dominating. Locating, metric-locating¿dominating and locating¿dominating sets of minimum cardinality are called ß-codes, ¿-codes and ¿-codes, respectively. A Nordhaus¿Gaddum bound is a tight lower or upper bound on the sum or product of a parameter of a graph G and its complement View the MathML source. In this paper, we present some Nordhaus¿Gaddum bounds for the location number ß, the metric-location¿domination number ¿ and the location¿domination number ¿. Moreover, in each case, the graph family attaining the corresponding bound is fully characterized.

    A dominating set S of graph G is called metric-locating–dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the vertices in S. If moreover, every vertex v not in S is also uniquely determined by the set of neighbors of v belonging to S, then it is said to be locating–dominating. Locating, metric-locating–dominating and locating–dominating sets of minimum cardinality are called β-codes, η-codes and λ-codes, respectively. A Nordhaus–Gaddum bound is a tight lower or upper bound on the sum or product of a parameter of a graph G and its complement View the MathML source. In this paper, we present some Nordhaus–Gaddum bounds for the location number β, the metric-location–domination number η and the location–domination number λ. Moreover, in each case, the graph family attaining the corresponding bound is fully characterized.

  • DISSENY, IMPLEMENTACIÓ I AVALUACIÓ DE PROPOSTES DE FEEDFORWARD SOSTENIBLE

     Pelayo Melero, Ignacio Manuel; Cano, Elena; Valero Baya, Jordi; Fabregat Fillet, Jaime; Ornat Longarón, César; Achaerandio Puente, Maria Isabel; Buenestado Caballero, Pablo; Pineda Soler, Eloy
    Competitive project

     Share

  • Access to the full text
    Some structural, metric and convex properties of the boundary of a graph  Open access

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos
    Ars combinatoria
    Vol. 109, p. 267-283
    Date of publication: 2013-04-25
    Journal article

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Let u;v be two vertices of a connected graph G . The vertex v is said to be a boundary vertex of u if no neighbor of v is further away from u than v . The boundary of a graph is the set of all its boundary vertices. In this work, we present a number of properties of the boundary of a graph under diÆerent points of view: (1) a realization theorem involving diÆerent types of boundary vertex sets: extreme set, periphery, contour, and the whole boundary; (2) the contour is a monophonic set; and (3) the cardinality of the boundary is an upper bound for both the metric dimension and the determining number of a graph

    Let u;v be two vertices of a connected graph G . The vertex v is said to be a boundary vertex of u if no neighbor of v is further away from u than v . The boundary of a graph is the set of all its boundary vertices. In this work, we present a number of properties of the boundary of a graph under diÆerent points of view: (1) a realization theorem involving diÆerent types of boundary vertex sets: extreme set, periphery, contour, and the whole boundary; (2) the contour is a monophonic set; and (3) the cardinality of the boundary is an upper bound for both the metric dimension and the determining number of a graph

  • Locating-dominating codes: Bounds and extremal cardinalities

     Cáceres, Jose; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz
    Applied mathematics and computation
    Vol. 220, p. 38-45
    Date of publication: 2013-09-01
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    In this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses should determine a malfunctioning processor or an intruder. Here, we present our contributions on ¿-codes and ¿-codes concerning bounds, extremal values and realization theorems

    In this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses should determine a malfunctioning processor or an intruder. Here, we present our contributions on λ-codes and η-codes concerning bounds, extremal values and realization theorems.

  • Access to the full text
    Locating domination in graphs and their complements  Open access

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel
    Date of publication: 2013-10-16
    Book chapter

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    A dominating set S of a graph G is called locating-dominating , 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 are called LD -codes and the cardinality of an LD-code is the location-domination number . An LD-set of a graph G is global if S is an LD-set of both G and its complement, G . In this work, we give some relations between the locating-dominating sets and location-domination number in a graph and its complement

  • Access to the full text
    Nuevas cotas para la parametros de dominacion y localizacion en grafos  Open access

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel
    Date of publication: 2013-10-16
    Book chapter

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    A dominating set S of a graph G is called locating-dominating , 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 are called LD -codes and the cardinality of an LD-code is the location-domination number . An LD-set of a graph G is global if S is an LD-set of both G and its complement, G . In this work, we give some relations between the locating-dominating sets and location-domination number in a graph and its complement

  • Global locating domination in bipartite graphs

     Pelayo Melero, Ignacio Manuel; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè
    British Combinatorial Conference
    Presentation's date: 2013-07-01
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Locating domination in graphs and their complements

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel
    Encuentro Andaluz de Matematica Discreta
    Presentation's date: 2013-10-17
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Nordhaus-Gaddum-type results for locating domination

     Pelayo Melero, Ignacio Manuel; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè
    Biennial Canadian Discrete and Algorithmic Mathematics Conference
    Presentation's date: 2013-06-13
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Nuevas cotas para la parametros de dominacion y localizacion en grafos

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel
    Encuentro Andaluz de Matematica Discreta
    Presentation's date: 2013-10-17
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • On the metric dimension of infinite graphs

     Cáceres, José; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz
    Discrete applied mathematics
    Vol. 160, num. 18, p. 2618-2626
    DOI: 10.1016/j.dam.2011.12.009
    Date of publication: 2012-12-07
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    A set of vertices Sresolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of a graph G is the minimum cardinality of a resolving set. In this paper we study the metric dimension of infinite graphs such that all its vertices have finite degree. We give necessary conditions for those graphs to have finite metric dimension and characterize infinite trees with finite metric dimension. We also establish some results about the metric dimension of the cartesian product of finite and infinite graphs, and give the metric dimension of the cartesian product of several families of graphs.

    Infinite graph; Locally finite graph; Resolving set; Metric dimension; Cartesian product

  • Access to the full text
    Aprendizaje colaborativo en base a problemas mediante el uso del foro electrónico  Open access

     Buenestado Caballero, Pablo; Minelli de Oliveira, Janaina; Moragas Gascons, Lluis; Rodriguez Perez, Ana Carmen; Cañadas Lorenzo, Juan Carlos; Pelayo Melero, Ignacio Manuel
    Date of publication: 2012-06-15
    Book chapter

    Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
  • Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación

     Aguilo Gost, Francisco de Asis Luis; Abiad Monge, Aida; Andrés Yebra, José Luis; Barriere Figueroa, Eulalia; Cámara Vallejo, Marc; Ball, Simeon Michael; Comellas Padro, Francesc de Paula; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Gomez Marti, Jose; Llado Sanchez, Anna; López Masip, Susana Clara; Miralles De La Asuncion, Alicia; Mitjana Riera, Margarida; Muñoz Lopez, Francisco Javier; Pelayo Melero, Ignacio Manuel; Garriga Valle, Ernest; Pérez Mansilla, Sonia; Rius Font, Miquel; Serra Albo, Oriol; Vena, Lluis; Vilaltella Castanyer, Joan; Zaragoza Monroig, Maria Luisa; Espona Dones, Margarida; Sau Valls, Ignasi; Montejano Cantoral, Amanda; Perarnau Llobet, Guillem; Moragas Vilarnau, Jordi; Vena Cros, Lluís; Andres Yebra, Jose Luis; Fiol Mora, Miquel Àngel
    Competitive project

     Share

  • Aprendizaje cooperativo en la asignatura de Estadística del grado en ingeniería realizando problemas con grupos grandes

     Buenestado Caballero, Pablo; Minelli de Oliveira, Janaina; Moragas Gascons, Lluis; Rodriguez Perez, Ana Carmen; Cañadas Lorenzo, Juan Carlos; Pelayo Melero, Ignacio Manuel
    Congreso Universitario de Innovación Educativa en las Enseñanzas Técnicas
    Presentation's date: 2012-07-19
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • E-learning: Diferentes didácticas antes las nuevas tecnologías

     Rodriguez Perez, Ana Carmen; Cañadas Lorenzo, Juan Carlos; Pelayo Melero, Ignacio Manuel; Buenestado Caballero, Pablo; Minelli de Oliveira, Janaina; Moragas Gascons, Lluis
    Congreso Universitario de Innovación Educativa en las Enseñanzas Técnicas
    Presentation's date: 2012-07-19
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

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

     Buenestado Caballero, Pablo; Minelli de Oliveira, Janaina; Moragas Gascons, Lluis; Rodriguez Perez, Ana Carmen; Cañadas Lorenzo, Juan Carlos; Pelayo Melero, Ignacio Manuel
    Foro internacional sobre la evaluación de la calidad de la investigación y de la educación superior
    p. 416
    Presentation's date: 2012-07-13
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Sesiones de docencia online: metodología y aspectos didácticos

     Pelayo Melero, Ignacio Manuel; Cañadas Lorenzo, Juan Carlos; Rodriguez Perez, Ana Carmen; Buenestado Caballero, Pablo
    Foro internacional sobre la evaluación de la calidad de la investigación y de la educación superior
    p. 410
    Presentation's date: 2012-06-13
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Parámetros de localización y dominación de un grafo y su complementario

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel
    Jornadas de Matemática Discreta y Algorítmica
    p. 45-52
    Presentation's date: 2012-07-11
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Dado un grafo G = (V,E), un conjunto S ⊂ V es localiza-dominante si ϕ ̸= N(u)∩S ̸= N(v)∩S ̸= ϕ para todo u, v ∈ V \S. Notamos λ(G) al cardinal m´ınimo de estos conjuntos. En este trabajo estudiamos la relaci´on entre λ(G) y λ(G), damos cotas ajustadas de λ(G)+λ(G) y caracterizamos los grafos que alcanzan dichas cotas. En particular demostramos que λ(G) y λ(G) a lo sumo difieren en una unidad. En el caso particular de ser G un ´arbol y G ̸= P2 demostramos que λ(G) ≤ λ(G) ≤ λ(G)+1.

  • Watching systems in complete bipartite graphs

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel
    Jornadas de Matemática Discreta y Algorítmica
    p. 53-60
    Presentation's date: 2012-07-11
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Access to the full text
    Aula virtual de apoyo a la docencia y al autoaprendizaje de cálculo para estudiantes universitarios con material docente y aplicaciones basadas en software libre  Open access

     Jarauta Bragulat, Eusebio; Pelayo Melero, Ignacio Manuel
    Foro internacional sobre la evaluación de la calidad de la investigación y de la educación superior
    p. 71
    Presentation's date: 2012-06-12
    Presentation of work at congresses

    Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

  • Metric dimension in infinite but locally finite graphs

     Cáceres, José; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz
    Canadian Discrete and Algorithmic Mathematics Conference
    Presentation's date: 2011-06-01
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Geodetic and hull numbers in strong product graphs

     Mora Gine, Mercè; Hernando Martin, Maria Del Carmen; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, Maria Luz
    Canadian Discrete and Algorithmic Mathematics Conference
    Presentation's date: 2011-06-01
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • The Longest path transit function of a graph and betweenness

     Changat, Manoj; Prasanth, G. N.; Pelayo Melero, Ignacio Manuel
    Utilitas mathematica
    Vol. 82, p. 111-127
    Date of publication: 2010
    Journal article

     Share Reference managers Reference managers Open in new window

  • On the geodetic and the hull numbers in strong product graphs

     Cáceres, Jose; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz
    Computers & mathematics with applications
    Vol. 60, num. 11, p. 3020-3031
    DOI: 10.1016/j.camwa.2010.10.001
    Date of publication: 2010-12
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    A set S of vertices of a connected graph G is convex, if for any pair of vertices u,vS, every shortest path joining u and v is contained in S. The convex hull CH(S) of a set of vertices S is defined as the smallest convex set in G containing S. The set S is geodetic, if every vertex of G lies on some shortest path joining two vertices in S, and it is said to be a hull set if its convex hull is V(G). The geodetic and the hull numbers of G are the minimum cardinality of a geodetic and a minimum hull set, respectively. In this work, we investigate the behavior of both geodetic and hull sets with respect to the strong product operation for graphs. We also establish some bounds for the geodetic number and the hull number and obtain the exact value of these parameters for a number of strong product graphs.

  • Access to the full text
    Extremal graph theory for metric dimension and diameter  Open access

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos; Wood, D. R.
    Electronic journal of combinatorics
    Vol. 17, num. 1 R30, p. 1-28
    Date of publication: 2010
    Journal article

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    A set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G. Let G ,D be the set of graphs with metric dimension and diameter D. It is well-known that the minimum order of a graph in G ,D is exactly + D. The first contribution of this paper is to characterise the graphs in G ,D with order + D for all values of and D. Such a characterisation was previously only known for D 6 2 or 6 1. The second contribution is to determine the maximum order of a graph in G ,D for all values of D and . Only a weak upper bound was previously known.

  • Access to the full text
    Boundary-type sets and product operators in graphs  Open access

     Cáceres, Jose; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz
    Jornadas de Matemática Discreta y Algorítmica
    p. 187-194
    Presentation's date: 2010-07-07
    Presentation of work at congresses

    Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

  • Geodetic and hull numbers of strong products of graphs

     Hernando Martin, Maria Del Carmen; Cáceres, Jose; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz
    Jornadas de Matemática Discreta y Algorítmica
    p. 195-205
    Presentation's date: 2010-07
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Valores extremos en los parámetros de dominación y resolución de un grafo

     Hernando Martin, Maria Del Carmen; Cáceres, Jose; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz
    Jornadas de Matemática Discreta y Algorítmica
    p. 207-218
    Presentation's date: 2010-07
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • On the metric dimension of infinite graphs

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel
    Electronic notes in discrete mathematics
    Vol. 35, p. 15-20
    DOI: 10.1016/j.endm.2009.11.004
    Date of publication: 2009-11-04
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    A set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of a graph G is the minimum cardinality of a resolving set. In this paper we undertake the metric dimension of infinite locally finite graphs, i.e., those infinite graphs such that all its vertices have finite degree. We give some necessary conditions for an infinite graph to have finite metric dimension and characterize infinite trees with finite metric dimension. We also establish some general results about the metric dimension of the Cartesian product of finite and infinite graphs, and obtain the metric dimension of the Cartesian product of several families of graphs.

  • Access to the full text
    Strong product of graphs: Geodetic and hull number and boundary-type sets  Open access

     Cáceres, José; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz
    Date: 2009-12
    Report

    Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

  • PROBLEMAS EXTREMALES Y DE OPTIMIZACIÓN EN TEORIA DE GRAFOS Y COMBINATORIA: APLICACIÓN AL ANALISIS Y ALGORITMOS DE REDES DE COMUNICAC

     Abiad Monge, Aida; Andres Yebra, Jose Luis; Aguilo Gost, Francisco de Asis Luis; Aroca Farrerons, Josep Maria; Ball, Simeon Michael; Barajas Tomas, Javier; Barguilla Navarrete, Jorge; Barriere Figueroa, Eulalia; Cámara Vallejo, Marc; Comellas Padro, Francesc de Paula; Dalfo Simo, Cristina; Espona Dones, Margarida; Fàbrega Canudas, Josep; Gago Alvarez, Silvia; Garriga Valle, Ernest; Gomez Marti, Jose; Llado Sanchez, Anna; López Masip, Susana Clara; Miralles De La Asuncion, Alicia; Mitjana Riera, Margarida; Montejano Cantoral, Amanda; Moragas Vilarnau, Jordi; Muñoz Lopez, Francisco Javier; Pelayo Melero, Ignacio Manuel; Perarnau Llobet, Guillem; Pérez Mansilla, Sonia; Rius Font, Miquel; Sau Valls, Ignasi; Serra Albo, Oriol; Vena, Lluis; Vilaltella Castanyer, Joan; Zaragoza Monroig, Maria Luisa; Vena Cros, Lluís; Fiol Mora, Miquel Àngel
    Competitive project

     Share

  • COMBINATÒRIA , TEORIA DE GRAFS I APLICACIONS

     López Masip, Susana Clara; Comellas Padro, Francesc de Paula; Fiol Mora, Miquel Àngel; Cámara Vallejo, Marc; Moragas Vilarnau, Jordi; Aguilo Gost, Francisco de Asis Luis; Aroca Farrerons, Josep Maria; Rius Font, Miquel; Espona Dones, Margarida; Garriga Valle, Ernest; Dalfo Simo, Cristina; Muñoz Lopez, Francisco Javier; Fàbrega Canudas, Josep; Miralles De La Asuncion, Alicia; Gomez Marti, Jose; Zaragoza Monroig, Maria Luisa; Pérez Mansilla, Sonia; Andres Yebra, Jose Luis; Ball, Simeon Michael; Barriere Figueroa, Eulalia; Llado Sanchez, Anna; Mitjana Riera, Margarida; Gago Alvarez, Silvia; Pelayo Melero, Ignacio Manuel; Serra Albo, Oriol
    Competitive project

     Share

  • Strong product of graphs: geodetic and hull numbers and boundary-type sets

     Hernando Martin, Maria Del Carmen; Puertas, Maria Luz; Cáceres, Jose; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel
    British Combinatorial Conference
    p. 61
    Presentation's date: 2009-07-09
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Metric dimension for infinite graphs

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz
    British Combinatorial Conference
    p. 26
    Presentation's date: 2009-07-07
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    On locating and dominating sets in graphs  Open access

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Cáceres, Jose; Puertas, Maria Luz; Pelayo Melero, Ignacio Manuel
    Workshop de Matemática Discreta Algarve/Andalucía. Encuentro Andaluz de Matemática Discreta
    p. 19-22
    Presentation's date: 2009-10-15
    Presentation of work at congresses

    Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

  • Extremal Graph Theory for Metric Dimension and Diameter

     Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos; Hernando, C; Wood, D R
    Date of publication: 2008-09
    Book chapter

     Share Reference managers Reference managers Open in new window

  • Álgebra lineal básica para ingeniería civil

     Pelayo Melero, Ignacio Manuel; Rubio Montaner, Francisco
    Date of publication: 2008
    Book

     Share Reference managers Reference managers Open in new window

  • Producto fuerte de grafos: invariantes de convexidad y conjuntos fronterizos

     Cáceres, José; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, María L
    Jornadas de Matemática Discreta y Algorítmica
    p. 215-222
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • On the metric dimension of infinite graphs

     Cáceres, J; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M L
    Jornadas de Matemática Discreta y Algorítmica
    p. 205-213
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Geodeticity of the contour of chordal graphs

     Caceres, J; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M L; Seara Ojea, Carlos
    Discrete applied mathematics
    Vol. 156, num. 7, p. 1132-1142
    Date of publication: 2008-04
    Journal article

     Share Reference managers Reference managers Open in new window

  • Dimensión métrica de grafos infinitos

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Seara Ojea, Carlos; Cáceres, J; Moreno-Gonzalez, A; Pelayo Melero, Ignacio Manuel; Puertas, M L
    Date of publication: 2007-03
    Book chapter

     Share Reference managers Reference managers Open in new window

  • Extremal Graph Theory for Metric Dimension and Diameter

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos; Wood, David
    European Conference on Combinatorics, Graph Theory, and Applications
    p. 339-343
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Grafos de orden máximo y mínimo con diàmetro y dimensión métrica fijados

     Seara Ojea, Carlos; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Wood, D R
    Jornadas de Matemática Discreta y Algorítmica
    p. 311-318
    Presentation's date: 2007-07-13
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Dimensión métrica de grafos infinitos

     Cáceres, J; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Moreno, A; Pelayo Melero, Ignacio Manuel; Puertas, M L; Seara Ojea, Carlos
    Encuentro Andaluz de Matemática Discreta
    p. 61-68
    Presentation's date: 2007
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Propuestas y sugerencias para implementar en proyectos docentes de módulos de fundamentos matemáticos: hacia la integración de las ingenierías técnicas en el marco del espacio europeo de educación superior

     Pelayo Melero, Ignacio Manuel; Blanco Abellan, Monica; Ginovart Gisbert, Marta
    Congreso Universitario de Innovación Educativa en las Enseñanzas Técnicas
    p. 979-988
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Access to the full text
    Propuestas y sugerencias para un proyecto docente de un módulo de fundamentos matemáticos: hacia la integración de las ingenierías técnicas en el marco del Espacio Europeo de Educación Superior.  Open access

     Pelayo Melero, Ignacio Manuel; Blanco Abellan, Monica; Ginovart Gisbert, Marta
    Congreso Universitario de Innovación Educativa en las Enseñanzas Técnicas
    p. 979-988
    Presentation's date: 2007-07-18
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Aunque aún falta precisar el significado, cometido e instrumentación de la propuesta de 60 créditos ECTS comunes a los títulos de cada una de las Ramas de conocimiento establecidas, estamos convencidos de que materias básicas del área de Matemática Aplicada estarán presentes en todos los planes de estudios de la Rama de Ingeniería y Arquitectura. El objetivo de esta comunicación es presentar propuestas concretas para insertar en proyectos docentes de módulos de Fundamentos Matemáticos, diseñadas en el ámbito específico de las escuelas de Ingeniería Técnica Agrícola y de Ingeniería Técnica Industrial de Barcelona (Universidad Politécnica de Cataluña), que podrán ser implementadas en las correspondientes titulaciones de grado enmarcadas en el EEES. A partir de la experiencia docente acumulada en las mencionadas escuelas, hemos articulado propuestas específicas que permitirán contextualizar de forma conveniente contenidos básicos comunes para estos módulos en el EEES, facilitando distintas configuraciones para las competencias específicas. Estas sugerencias combinan diferentes metodologías docentes y alternan distintos tipos de actividades para favorecer el desarrollo de competencias en la resolución de problemas. Problemas que en esta presentación se centrarán en el contenido “Optimización”, proponiendo actividades formativas con sus créditos ECTS y su relación con las competencias que debe adquirir un estudiante en los estudios de estas escuelas universitarias.

  • Extremal Graph Theory for Metric Dimension and Diameter

     Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos; Wood, D R
    Electronic notes in discrete mathematics
    Vol. 29, p. 339-343
    DOI: 10.1016/j.endm.2007.07.058
    Date of publication: 2007-08
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • On the Metric Dimension of Cartesian Products of Graphs

     Cáceres, J; Hernando Martin, Maria Del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M L; Seara Ojea, Carlos; Wood, David
    SIAM journal on discrete mathematics
    Vol. 21, num. 2, p. 423-441
    Date of publication: 2007-05
    Journal article

     Share Reference managers Reference managers Open in new window

  • On the connectivity of cages with girth five, six and eight

     Marcote Ordax, Francisco Javier; Balbuena Martinez, Maria Camino Teofila; Pelayo Melero, Ignacio Manuel
    Discrete mathematics
    Vol. 307, num. 11-12, p. 1441-1446
    DOI: doi:10.1016/j.disc.2005.11.082
    Date of publication: 2007-05
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window