Reports de recerca
http://hdl.handle.net/2117/3180
2016-02-12T20:57:38ZOn cyclic Kautz digraphs
http://hdl.handle.net/2117/80848
On cyclic Kautz digraphs
Böhmová, Katerina; Dalfó Simó, Cristina; Huemer, Clemens
A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and out-degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphs MCK(d, `) and it is derived from the Kautz digraphs K(d, `). It is well-known that the Kautz digraphs K(d, `) have the smallest diameter among all digraphs with their number of vertices and degree. We define the cyclic Kautz digraphs
CK(d, `), whose vertices are labeled by all possible sequences a1 . . . a` of length `, such that each character ai is chosen from an alphabet containing d + 1 distinct symbols, where the consecutive characters in the sequence are different (as in Kautz digraphs), and now also requiring that a1 6= a`. The cyclic Kautz digraphs CK(d, `) have arcs between vertices a1a2 . . . a` and a2 . . . a`a`+1, with a1 6= a` and a2 6= a`+1. Unlike in Kautz digraphs K(d, `), any label of a vertex of CK(d, `) can be cyclically shifted to form again a label of a vertex of CK(d, `).
We give the main parameters of CK(d, `): number of vertices, number of arcs, and diameter.
Moreover, we construct the modified cyclic Kautz digraphs MCK(d, `) to obtain the same diameter as in the Kautz digraphs, and we show that MCK(d, `) are d-out-regular.
Finally, we compute the number of vertices of the iterated line digraphs of CK(d, `).
2015-12-17T10:58:24ZBöhmová, KaterinaDalfó Simó, CristinaHuemer, ClemensA prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and out-degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphs MCK(d, `) and it is derived from the Kautz digraphs K(d, `). It is well-known that the Kautz digraphs K(d, `) have the smallest diameter among all digraphs with their number of vertices and degree. We define the cyclic Kautz digraphs
CK(d, `), whose vertices are labeled by all possible sequences a1 . . . a` of length `, such that each character ai is chosen from an alphabet containing d + 1 distinct symbols, where the consecutive characters in the sequence are different (as in Kautz digraphs), and now also requiring that a1 6= a`. The cyclic Kautz digraphs CK(d, `) have arcs between vertices a1a2 . . . a` and a2 . . . a`a`+1, with a1 6= a` and a2 6= a`+1. Unlike in Kautz digraphs K(d, `), any label of a vertex of CK(d, `) can be cyclically shifted to form again a label of a vertex of CK(d, `).
We give the main parameters of CK(d, `): number of vertices, number of arcs, and diameter.
Moreover, we construct the modified cyclic Kautz digraphs MCK(d, `) to obtain the same diameter as in the Kautz digraphs, and we show that MCK(d, `) are d-out-regular.
Finally, we compute the number of vertices of the iterated line digraphs of CK(d, `).Perfect anda quasiperfect domination in trees
http://hdl.handle.net/2117/77007
Perfect anda quasiperfect domination in trees
Cáceres, Jose; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz
2015-09-22T10:11:25ZCáceres, JoseHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelPuertas, M. LuzOn global location-domination in bipartite graphs
http://hdl.handle.net/2117/28318
On global location-domination in bipartite graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel
2015-06-16T09:42:50ZHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelApproximate results for rainbow labelings
http://hdl.handle.net/2117/27843
Approximate results for rainbow labelings
Lladó Sánchez, Ana M.
Article de recerca
2015-05-08T11:21:05ZLladó Sánchez, Ana M.On star-forest ascending subgraph decomposition
http://hdl.handle.net/2117/27841
On star-forest ascending subgraph decomposition
Aroca Farrerons, José María; Lladó Sánchez, Ana M.
2015-05-08T11:15:42ZAroca Farrerons, José MaríaLladó Sánchez, Ana M.Decomposing almost complete graphs by random trees
http://hdl.handle.net/2117/27840
Decomposing almost complete graphs by random trees
Lladó Sánchez, Ana M.
2015-05-08T11:13:27ZLladó Sánchez, Ana M.On perfect and quasiperfect domination in graphs
http://hdl.handle.net/2117/27709
On perfect and quasiperfect domination in graphs
Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M Luz
2015-05-04T10:26:03ZCáceres, JoséHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelPuertas, M LuzGlobal location-domination in graphs
http://hdl.handle.net/2117/27680
Global location-domination in graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel
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 are called LD-codes and the cardinality of an LD-code is the
location-domination number (G). An LD-set
S of a graph G is global if it is an LD-set of both G and its complement G. The
global location-domination number g(G) is the minimum cardinality of a global LD-set of
G. In this work,we give some relations between locating-dominating sets and the location-domination number in a graph and its complement
Domination, Global domination, Locating domination, Complement graph, Block-cactus, Trees
2015-04-30T08:12:31ZHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelA 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 are called LD-codes and the cardinality of an LD-code is the
location-domination number (G). An LD-set
S of a graph G is global if it is an LD-set of both G and its complement G. The
global location-domination number g(G) is the minimum cardinality of a global LD-set of
G. In this work,we give some relations between locating-dominating sets and the location-domination number in a graph and its complementJacobi matrices and boundary value problems in distance-regular graphs
http://hdl.handle.net/2117/14821
Jacobi matrices and boundary value problems in distance-regular graphs
Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gago Álvarez, Silvia
In this work we analyze regular boundary value problems on a distance-regular graph associated with SchrÄodinger operators. These problems include the cases in which the boundary has two or one vertices. Moreover, we obtain the Green matrix for each regular problem. In each case, the Green matrices are given in terms of two families of orthogonal polynomials one of them corresponding with the distance polynomials of the distance-regular graphs.
2012-01-26T10:21:55ZBendito Pérez, EnriqueCarmona Mejías, ÁngelesEncinas Bachiller, Andrés MarcosGago Álvarez, SilviaIn this work we analyze regular boundary value problems on a distance-regular graph associated with SchrÄodinger operators. These problems include the cases in which the boundary has two or one vertices. Moreover, we obtain the Green matrix for each regular problem. In each case, the Green matrices are given in terms of two families of orthogonal polynomials one of them corresponding with the distance polynomials of the distance-regular graphs.A differential approach for bounding the index of graphs under perturbations
http://hdl.handle.net/2117/12078
A differential approach for bounding the index of graphs under perturbations
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
2011-03-25T15:57:30ZDalfó Simó, CristinaFiol Mora, Miquel ÀngelGarriga Valle, Ernest