Enviaments recents

  • Location in maximal outerplanar graphs 

    Claverol Aguas, Mercè; García, Alfredo; Hernández, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel, Javier (2017)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    In this work we study the metric dimension and the location-domination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal ...
  • Dynamic programming for graphs on surfaces 

    Rué Perna, Juan José; Sau, Ignasi; Thilikos, Dimitrios (Springer, 2010)
    Text en actes de congrés
    Accés obert
    We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where ...
  • Random cubic planar graphs revisited 

    Rué Perna, Juan José; Noy Serrano, Marcos; Requile, Clement (Elsevier, 2016)
    Altres
    Accés restringit per política de l'editorial
    The goal of our work is to analyze random cubic planar graphs according to the uniform distribution. More precisely, let G be the class of labelled cubic planar graphs and let gn be the number of graphs with n vertices. ...
  • Exploiting symmetry on the Universal Polytope 

    Pfeifle, Julián (2012)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    The most successful method to date for finding lower bounds on the number of simplices needed to triangulate a given polytope P involves optimizing a linear functional over the associated Universal Polytope U(P). However, ...
  • On two distributions of subgroups of free groups 

    Bassino, Frédérique; Martino, Armando; Nicaud, Cyril; Ventura Capell, Enric; Weil, Pascal (Society for Industrial and Applied Mathematics, 2010)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    We study and compare two natural distributions of finitely generated subgroups of free groups. One is based on the random generation of tuples of reduced words; that is the one classically used by group theorists. The ...
  • On the evaluation of the Tutte polynomial at the points (1,-1) and (2,-1) 

    Goodall, Andrew; Merino, Criel; Mier Vinué, Anna de; Noy Serrano, Marcos (2010)
    Text en actes de congrés
    Accés obert
    C. Merino proved recently the following identity between evaluations of the Tutte polynomial of complete graphs: t($K_{n+2}$; 1,−1) = t($K_n$;2,−1). In this work we extend this result by giving a large class of graphs with ...
  • 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.
  • An algorithm to design prescribed length codes for single-tracked shaft encoders 

    Balle Pigem, Borja de; Ventura Capell, Enric; Fuertes Armengol, José Mª (2009-04-14)
    Text en actes de congrés
    Accés obert
    Abstract-Maximal-length binary shift register sequences have been known for a long time. They have many interesting properties, one of them is that when taken in blocks of n consecutive positions they form 2n - 1 different ...
  • On polytopality of Cartesian products of graphs 

    Pfeifle, Julián; Pilaud, Vincent; Santos Pérez, Francisco Javier (2010-07)
    Text en actes de congrés
    Accés obert
    We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we prove that a product of graphs is the graph of a simple polytope if and only if its factors are. On the other hand, we provide ...
  • Graph operations and Laplacian eigenpolytopes 

    Padrol Sureda, Arnau; Pfeifle, Julián (2010-07)
    Text en actes de congrés
    Accés obert
    We introduce the Laplacian eigenpolytopes ("L-polytopes") associated to a simple undirected graph G, investigate how they change under basic operations such as taking the union, join, complement, line graph and cartesian ...

Mostra'n més