Browsing by Author "López Masip, Susana Clara"

A new application of the $\otimes_h$product to $\alpha$labelings
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (2015)
Article
Open AccessThe weak tensor product was introduced by Snevily as a way to construct new graphs that admit alabelings from a pair of known agraphs. In this article, we show that this product and the application to alabelings can be ... 
A new labeling construction from the product
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Prabu, M. (20170801)
Article
Open AccessThe ¿hproduct 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 ... 
Bimagic and other generalizations of super edgemagic labelings
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (20110615)
Article
Restricted access  publisher's policyIn this paper, we use the product ⊗h in order to study super edgemagic labelings, bimagic labelings and optimal kequitable labelings. We establish, with the help of the product ⊗h, new relations between super edgemagic ... 
Characterizing pathlike trees from linear configurations
López Masip, Susana Clara (2017)
Conference lecture
Open AccessAssume that we embed the path Pn as a subgraph of a 2dimensional 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
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (20150224)
Article
Open AccessFigueroaCenteno 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.
López Masip, Susana Clara (Universitat Politècnica de Catalunya, 20030220)
Doctoral thesis
Open Access 
(Di)graph products, labelings and related results
López Masip, Susana Clara (201707)
Article
Open AccessGallian'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
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (20160105)
Article
Open AccessA 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 edgemagic labelings for some types of pathlike trees
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (20100602)
Article
Open AccessThe 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 edgemagic labelings of some types of pathlike trees. As a ... 
Enumerating super edgemagic labelings for the union of nonisomorphic graphs
Ahmad, Ali; López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (20110615)
Article
Open AccessA super edgemagic 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
Lladó Sánchez, Ana M.; López Masip, Susana Clara; Moragas Vilarnau, Jordi (20100228)
Article
Restricted access  publisher's policyLet T be a tree with m edges. A wellknown 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
Espona Dones, Margarida; López Masip, Susana Clara; Rué Perna, Juan José (Universitat Politècnica de Catalunya, 20180611)
Exam
Restricted access to the UPC academic community 
Langford sequences and a product of digraphs
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (20151207)
Article
Open AccessSkolem and Langford sequences and their many generalizations have applications in numerous areas. The ¿hproduct is a generalization of the direct product of digraphs. In this paper we use the ¿hproduct and super edgemagic ... 
Magic coverings and the Kronecker product
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (20141101)
Article
Restricted access  publisher's policyIn 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
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (20091211)
Article
Open AccessIn 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
Espona Dones, Margarida; López Masip, Susana Clara; Rué Perna, Juan José (Universitat Politècnica de Catalunya, 20180411)
Exam
Restricted access to the UPC academic community 
On the betanumber of forests with isomorphic components
Ichishima, R.; López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Oshima, Akito (2018)
Article
Open AccessThe betanumber, ß (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 edgemagic graphs
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (20140101)
Article
Restricted access  publisher's policyThe study of the possible valences for edgemagic labelings of graphs has motivated us to introduce the concept of perfect edgemagic graphs. Intuitively speaking, an edgemagic graph is perfect edgemagic if all possible ... 
Perfect (super) EdgeMagic Crowns
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Prabu, M. (20170106)
Article
Open AccessA graph G is called edgemagic 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 edgemagic y temas relacionados
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2010)
Conference report
Open AccessEl 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 ...