Enviaments recents

  • Caracterizaciones combinatorias y algebraicas de grafos distancia-regulares 

    Fiol Mora, Miquel Àngel (Universidad de Cádiz, 2013)
    Capítol de llibre
    Accés restringit per política de l'editorial
    Los grafos distancia-regulares aparecen a menudo en el estudio de estructuras matemáticas con un alto grado de simetría y/o regularidad. Un ejemplo bien conocido de tales grafos son los esqueletos de los sólidos platónicos. ...
  • c-Critical graphs with maximum degree three 

    Fiol Mora, Miquel Àngel (John Wiley and Sons, Inc., 1995)
    Capítol de llibre
    Accés restringit per política de l'editorial
    Let $G$ be a (simple) gtoph with maximum degree three and chromatic index four. A 3-edge-coloring of G is a coloring of its edges in which only three colors are used. Then a vertex is conflicting when some edges incident ...
  • An algebraic model for the storage of data in parallel memories 

    Fiol Mora, Miquel Àngel; Serra Albó, Oriol (Springer, 1989)
    Capítol de llibre
    Accés obert
    The use of SIMD computers requires efficient schemes of storage of data in order to have conflict-free acces in parallel computation. In this paper we restate the problem of finding such chemes in an algebraic context. ...
  • Connectivity: properties and structure 

    Balbuena Martínez, Maria Camino Teófila; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel (CRC Press Taylor & Francis Group, 2013-12-05)
    Capítol de llibre
    Accés obert
    Connectivity is one of the central concepts of graph theory, from both a theoret- ical and a practical point of view. Its theoretical implications are mainly based on the existence of nice max-min characterization results, ...
  • Further topics in connectivity 

    Balbuena Martínez, Maria Camino Teófila; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel (CRC Press Taylor & Francis Group, 2013-12-05)
    Capítol de llibre
    Accés obert
    Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (sufficient) conditions under which a graph or digraph has a given connectivity or edge-connectivity. First, we describe results ...
  • Locating domination in graphs and their complements 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (Universidad de Sevilla, 2013-10-16)
    Capítol de llibre
    Accés obert
    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 ...
  • The polynomial method in Galois geometries 

    Ball, Simeon Michael (Nova Science Publishers, 2012)
    Capítol de llibre
    Accés restringit per política de l'editorial
    The polynomial method refers to the application of polynomials to combinatorial problems. The method is particularly effective for Galois geometries and a number of problems and conjectures have been solved using the ...
  • Polynomials in finite geometry 

    Ball, Simeon Michael; Blokhuis, Aart (Università degli studi di Napoli. Dipartimento di Matematica, 1999-11-01)
    Capítol de llibre
    Accés obert
  • 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)
    Capítol de llibre
    Accés obert
    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 ...

Mostra'n més