DSpace Community:
http://hdl.handle.net/2117/3178
20150306T21:39:03Z

The degree/diameter problem in maximal planar bipartite graphs
http://hdl.handle.net/2117/26448
Title: The degree/diameter problem in maximal planar bipartite graphs
Authors: Dalfó Simó, Cristina; Huemer, Clemens; Salas Piñon, Julián
Abstract: The (¿;D) (degree/diameter) problem consists of nding the largest possible number of vertices n among all the graphs with maximum degree ¿ and diameter D. We consider the (¿;D) problem for maximal planar bipartite graphs, that are simple planar graphs in which every face is a quadrangle. We obtain that for the (¿; 2) problem, the number of vertices is n = ¿+2; and for the (¿; 3) problem, n = 3¿¿1 if ¿ is odd and n = 3¿ ¿ 2 if ¿ is even. Then, we study the general case (¿;D)
and obtain that an upper bound on n is approximately 3(2D + 1)(¿ ¿ 2)¿D=2¿ and another one is C(¿ ¿ 2)¿D=2¿ if ¿ D and C is a sufficiently large constant. Our upper bound improve for our kind of graphs the one given by Fellows, Hell and Seyffarth for general planar graphs. We also give a lower bound on n for maximal planar bipartite graphs, which is approximately (¿ ¿ 2)k if D = 2k, and 3(¿ ¿ 3)k if D = 2k + 1, for ¿ and D sufficiently large in both cases.
20150220T12:42:33Z

From clutters to matroids
http://hdl.handle.net/2117/26235
Title: From clutters to matroids
Authors: Martí Farré, Jaume
20150205T13:56:31Z

Formación interdisciplinar de educación para el desarrollo dirigida a docentes de titulaciones científicotécnicas en un entorno virtual de aprendizaje
http://hdl.handle.net/2117/26103
Title: Formación interdisciplinar de educación para el desarrollo dirigida a docentes de titulaciones científicotécnicas en un entorno virtual de aprendizaje
Authors: Pérez Mansilla, Sonia; BONI, A; Pérez Foguet, Agustí
Abstract: Desde 2001, ISF se ha planteado como estrateg
ia prioritaria para la promoción de la
educación para el desarrollo en la universi
dad, la formación del profesorado de carreras
científicotécnicas. El objeti
vo general es la promoción
de la tecnología para el
desarrollo humano en los estudios de i
ngeniería (PérezFoguet et al., 2005).
La estrategia planteada se concretó en
el año 2003 con el cu
rso semipresencial
“Educando en Tecnología para el Desarro
llo”, de 84h de duración y en el que
participaron un total de 61 profesores unive
rsitarios (Boni et al., 2004). En el 2004, se
realizó un taller presencial de
12h titulado “La educación en valores en el ámbito de los
estudios técnicos: el reto del Espaci
o Europeo de Educación Superior”.
Tras estas dos experiencias, se ha realiza
do durante el primer semestre del 200506, el
curso interuniversitario semipresencial
“La universidad, instru
mento de solidaridad.
La enseñanzaaprendizaje para el desarrollo humano sostenible en los estudios
científicotécnicos”
, de 125 horas de duración (5 ECTS
) y acreditado por los Institutos
de Ciencias de la Educación de las siguien
tes Universidades: UPM, UPV, UAB, UB y
UPC.
En este artículo se analizará esta acción
formativa desde dos perspectivas: valorando su
relación con el nuevo Espacio Europeo de
Educación Superior y considerando las
posibilidades que ofrece una comunidad virtua
l de aprendizaje formada por expertos y
docentes universitarios.
20150127T11:36:14Z

On the ascending subgraph decomposition problem for bipartite graphs
http://hdl.handle.net/2117/26088
Title: On the ascending subgraph decomposition problem for bipartite graphs
Authors: Aroca Farrerons, José María; Lladó Sánchez, Ana M.
Abstract: The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with View the MathML source(n+12) edges admits an edge decomposition G=H1¿¿¿HnG=H1¿¿¿Hn such that HiHi has i edges and is isomorphic to a subgraph of Hi+1Hi+1, i=1,…,n1i=1,…,n1. We show that every bipartite graph G with View the MathML source(n+12) edges such that the degree sequence d1,…,dkd1,…,dk of one of the stable sets satisfies di=ni+2di=ni+2, 1=i<k1=i<k, admits an ascending subgraph decomposition with star forests. We also give a necessary condition on the degree sequence which is not far from the above sufficient one.
20150127T09:27:34Z

On perfect and quasiperfect dominations in graphs
http://hdl.handle.net/2117/24831
Title: On perfect and quasiperfect dominations in graphs
Authors: Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz
20141125T10:36:52Z

LDgraphs and global locationdomination in bipartite graphs
http://hdl.handle.net/2117/24830
Title: LDgraphs and global locationdomination in bipartite graphs
Authors: Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel
Abstract: A dominating setS of a graph G is a locatingdominatingset, LDset for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locatingdominating sets of minimum cardinality are called LD  codes
and the cardinality of an LDcode is the
locationdomination number
,
¿
(
G
).
An LDset
S
of a graph
G
is
global
if it is an LDset for both
G
and its complement,
G
. One of the main contributions of this work is the definition of the
LDgraph
,an
edgelabeled graph associated to an LDset, that will be very helpful to deduce some
properties of locationdomination in graphs. Concretely, we use LDgraphs to study
the relation between the locationdomination number in a bipartite graph and its
complement
20141125T10:34:30Z

The graph distance game and some graph operations
http://hdl.handle.net/2117/24796
Title: The graph distance game and some graph operations
Authors: Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz
Abstract: In the graph distance game, two players alternate in constructing a max
imal path. The objective function is the distance between the two endpoints of the
path, which one player tries to maximize and the other tries to minimize. In this paper
we examine the distance game for various graph operations: the join, the corona and
the lexicographic product of graphs. We provide general bounds and exact results for
special graphs
20141121T12:24:49Z

On the local spectra of the subconstituents of a vertex set and completely pseudoregular codes
http://hdl.handle.net/2117/24667
Title: On the local spectra of the subconstituents of a vertex set and completely pseudoregular codes
Authors: Cámara Vallejo, Marc; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Abstract: In this paper we study the relation between the local spectrum of a vertex set C and the local spectra of its subconstituents. In particular, it is shown that, when C is a completely regular code, such spectra are uniquely determined by the local spectra of C. Moreover, we obtain a new characterization for completely pseudoregular codes, and consequently for completely regular codes, in terms of the relation between the local spectrum of an extremal set of vertices and the local spectrum of its antipodal set. We also present a new proof of the version of the spectral excess theorem for extremal sets of vertices. (C) 2013 Elsevier B.V. All rights reserved.
20141111T09:51:20Z

LDgraphs and global locationdomination in bipartite graphs
http://hdl.handle.net/2117/24527
Title: LDgraphs and global locationdomination in bipartite graphs
Authors: Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel
Abstract: A dominating set S of a graph G is a locatingdominatingset, LDset for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S . Locatingdominating sets of minimum cardinality are called LDcodes and the cardinality of an LDcode is the locationdomination number, ¿(G)¿(G). An LDset S of a graph G is global if it is an LDset for both G and its complement, View the MathML sourceG¯. One of the main contributions of this work is the definition of the LDgraph, an edgelabeled graph associated to an LDset, that will be very helpful to deduce some properties of locationdomination in graphs. Concretely, we use LDgraphs to study the relation between the locationdomination number in a bipartite graph and its complement.
20141031T12:08:44Z

The graph distance game and some graph operations
http://hdl.handle.net/2117/24526
Title: The graph distance game and some graph operations
Authors: Cáceres, Jose; Puertas, M. Luz; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel
Abstract: In the graph distance game, two players alternate in constructing a maximal path. The objective function is the distance between the two endpoints of the path, which one player tries to maximize and the other tries to minimize. In this paper we examine the distance game for various graph operations: the join, the corona and the lexicographic product of graphs. We provide general bounds and exact results for special graphs
20141031T12:00:32Z

Quantum Google in a complex network
http://hdl.handle.net/2117/24220
Title: Quantum Google in a complex network
Authors: Paparo, Giuseppe Davide; Muller, Markus; Comellas Padró, Francesc de Paula; Martin Delgado, Miguel Angel
Abstract: We investigate the behaviour of the recently proposed Quantum PageRank algorithm, in large complex networks. We find that the algorithm is able to univocally reveal the underlying topology of the network and to identify and order the most relevant nodes. Furthermore, it is capable to clearly highlight the structure of secondary hubs and to resolve the degeneracy in importance of the low lying part of the list of rankings. The quantum algorithm displays an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced powerlaw behaviour in the distribution of importance, as compared to the classical algorithm. We test the performance and confirm the listed features by applying it to real world examples from the WWW. Finally, we raise and partially address whether the increased sensitivity of the quantum algorithm persists under coordinated attacks in scalefree and random networks.
20141002T17:35:16Z

On the representability of the biuniform matroid
http://hdl.handle.net/2117/24101
Title: On the representability of the biuniform matroid
Authors: Ball, Simeon Michael; Padró Laimon, Carles; Weiner, Zsuzsa; Xing, Chaoping
Abstract: Every biuniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given biuniform matroid has not been proved. The interest of these problems is due to their implications to secret sharing. The existence of efficient methods to find representations for all biuniform matroids is proved here for the first time. The previously known efficient constructions apply only to a particular class of biuniform matroids, while the known general constructions were not proved to be efficient. In addition, our constructions provide in many cases representations over smaller finite fields.
© 2013, Society for Industrial and Applied Mathematics
20140918T16:05:12Z

The degreediameter problem in maximal bipartite planar graphs
http://hdl.handle.net/2117/24097
Title: The degreediameter problem in maximal bipartite planar graphs
Authors: Dalfó Simó, Cristina; Huemer, Clemens; Salas, Julian
Abstract: The (A ,D) (degree/diameter) problem consists of finding the largest possible number of vertices n among all the graphs with maximum degree and diameter D. We consider the (A ,D) problem for maximal planar bipartite graphs, that are simple planar graphs in which every face is a quadrangle. We obtain that for the ( , 2) problem, the number of vertices is n = + 2; and for the ( , 3) problem, n = 3 1 if is odd and n = 3 2 if is even. Then, we study the general case ( A ,D) and obtain that an upper bound on n is approximately 3(2D+1)( 2)bD/2c,
and another one is C(  2)bD/2c if D and C is a sufficiently large constant.
Our upper bounds improve for our kind of graphs the one given by Fellows, Hell and Seyffarth for general planar graphs. We also give a lower bound on n for maximal planar bipartite graphs, which is approximately (  2)k if D = 2k, and 3(  3)k if D = 2k + 1, for and D sufficiently large in both cases.
20140918T10:55:22Z

A bound for the maximum weight of a linear code
http://hdl.handle.net/2117/24092
Title: A bound for the maximum weight of a linear code
Authors: Ball, Simeon Michael; Blokhuis, Aart
Abstract: It is shown that the parameters of a linear code over Fq of length n, dimension k, minimum weight d, and maximum weight m satisfy a certain congruence relation. In the case that q = p is a prime, this leads to the bound m &le (nd)pe(p1), where e {0, 1,.., k2} is maximal with the property that (nde) 0 (mod pk1e). Thus, if C contains a codeword of weight n, then nd/(p1)+d+e. The results obtained for linear codes are translated into corresponding results for (n, t)arcs and tfold blocking sets of AG(k1, q). The bounds obtained in these spaces are better than the known bounds for these geometrical objects for many parameters
20140917T17:03:50Z

Simulation of cable dynamics for moored ocean platforms: modeling aids design of large, underwater power cable
http://hdl.handle.net/2117/23616
Title: Simulation of cable dynamics for moored ocean platforms: modeling aids design of large, underwater power cable
Authors: Prat Farran, Joana d'Arc; Zaragoza Monroig, M. Luisa; Río Fernandez, Joaquín del
20140725T10:56:15Z