Now showing items 1-20 of 24

• #### A new application of the $\otimes_h$-product to $\alpha$-labelings ﻿

(2015)
Article
Open Access
The weak tensor product was introduced by Snevily as a way to construct new graphs that admit a-labelings from a pair of known a-graphs. In this article, we show that this product and the application to a-labelings can be ...
• #### A new labeling construction from the -product ﻿

(2017-08-01)
Article
Open Access
The ¿h-product that is referred in the title was introduced in 2008 as a generalization of the Kronecker product of digraphs. Many relations among labelings have been obtained since then, always using as a second factor a ...
• #### Bi-magic and other generalizations of super edge-magic labelings ﻿

(2011-06-15)
Article
Restricted access - publisher's policy
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labelings and optimal k-equitable labelings. We establish, with the help of the product ⊗h, new relations between super edge-magic ...
• #### Characterizing path-like trees from linear configurations ﻿

(2017)
Conference lecture
Open Access
Assume that we embed the path Pn as a subgraph of a 2-dimensional grid, namely, Pk¿Pl. Given such an embedding, we consider the ordered set of subpaths L1, L2,...,Lm which are maximal straight segments in the embedding, ...
• #### Connectivity and other invariants of generalized products of graphs ﻿

(2015-02-24)
Article
Open Access
Figueroa-Centeno et al. [4] introduced the following product of digraphs let D be a digraph and let G be a family of digraphs such that V (F) = V for every F¿G. Consider any function h:E(D)¿G. Then the product D¿hG is the ...
• #### Descomposicions de grafs en arbres. ﻿

(Universitat Politècnica de Catalunya, 2003-02-20)
Doctoral thesis
Open Access
• #### (Di)graph products, labelings and related results ﻿

(2017-07)
Article
Open Access
Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can ...
• #### Distance labelings: a generalization of Langford sequences ﻿

(2016-01-05)
Article
Open Access
A Langford sequence of order m and defect d can be identified with a labeling of the vertices of a path of order 2m in which each labeled from d up to d + m - 1 appears twice and in which the vertices that have been label ...
• #### Enumerating super edge-magic labelings for some types of path-like trees ﻿

(2010-06-02)
Article
Open Access
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to obtain lower bounds for the number of non isomorphic super edge-magic labelings of some types of path-like trees. As a ...
• #### Enumerating super edge-magic labelings for the union of non-isomorphic graphs ﻿

(2011-06-15)
Article
Open Access
A super edge-magic labeling of a graph G=(V,E) of order p and size q is a bijection f:V ∪E→{i}p+qi=1 such that: (1) f(u)+f(uv)+f(v)=k for all uv∈E; and (2) f(V )={i}pi=1. Furthermore, when G is a linear forest, the super ...
• #### Every tree is a large subtree of a tree that decomposes Kn or Kn,n ﻿

(2010-02-28)
Article
Restricted access - publisher's policy
Let T be a tree with m edges. A well-known conjecture of Ringel states that T decomposes the complete graph $K_{2m+1}$. Graham and Häggkvist conjectured that T also decomposes the complete bipartite graph $K_{m,m}$. In ...
• #### FQ primavera 2018 ﻿

(Universitat Politècnica de Catalunya, 2018-06-11)
Exam
• #### Langford sequences and a product of digraphs ﻿

(2015-12-07)
Article
Open Access
Skolem and Langford sequences and their many generalizations have applications in numerous areas. The ¿h-product is a generalization of the direct product of digraphs. In this paper we use the ¿h-product and super edge-magic ...
• #### Magic coverings and the Kronecker product ﻿

(2014-11-01)
Article
Restricted access - publisher's policy
In this paper we study a relationship existing among (super) magic coverings and the well known Kronecker product of matrices. We also introduce the concept of Z(n)-property for digraphs in order to study this relation ...
• #### Magic coverings and the Kronecker product ﻿

(2009-12-11)
Article
Open Access
In this paper we study a relationship existing among (super) magic coverings and the well known Kronecker product of matrices. We also introduce the concept of Zn–property for digraphs in order to study this relation ...
• #### MQ primavera 2018 ﻿

(Universitat Politècnica de Catalunya, 2018-04-11)
Exam
• #### On the beta-number of forests with isomorphic components ﻿

(2018)
Article
Open Access
The beta-number, ß (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) ¿ {0, 1, . . . , n} such that each uv ¿ E (G) is labeled |f (u) - f (v)| ...
• #### Perfect edge-magic graphs ﻿

(2014-01-01)
Article
Restricted access - publisher's policy
The study of the possible valences for edge-magic labelings of graphs has motivated us to introduce the concept of perfect edge-magic graphs. Intuitively speaking, an edge-magic graph is perfect edge-magic if all possible ...
• #### Perfect (super) Edge-Magic Crowns ﻿

(2017-01-06)
Article
Open Access
A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges to the set {1,2,…,|V(G)|+|E(G)|} such that the sum f(x)+f(xy)+f(y) for any xy in E(G) is constant. Such a function is ...
• #### Problemas abiertos sobre etiquetamientos super edge-magic y temas relacionados ﻿

(2010)
Conference report
Open Access
El tema de los etiquetamientos de grafos ha experimentado un fuerte impulso en los últimos 40 años, muestra de ello son los dos libros dedicados en exclusiva a ellos, un completísimo artículo ”survey” y más de 1000 ...