Browsing by Author "Muntaner Batle, Francesc Antoni"

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 note on the degree sequences of graphs with restrictions
Muntaner Batle, Francesc Antoni; Rius Font, Miquel (20080115)
Article
Open AccessDegree sequences of some types of graphs will be studied and characterized in this paper. 
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 ... 
Bounds on the size of super edgemagic graphs depending on the girth
Ichishima, Rikio; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (20091213)
External research report
Open AccessLet G = (V,E) be a graph of order p and size q. It is known that if G is super edgemagic graph then q 2p−3. Furthermore, if G is super edgemagic and q = 2p−3, then the girth of G is 3. It is also known that if the ... 
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 ... 
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 ... 
Labeling Generating Matrices
Muntaner Batle, Francesc Antoni; Rius Font, Miquel; Ichishima, Rikio; Figueroa Centeno, Ramon M. (200609)
Article
Open AccessThis paper is mainly devoted to generate (special)(super) edgemagic labelings of graphs using matrices. Matrices are used in order to find lower bounds for the number of nonisomorphic (special)(super) edgemagic ... 
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 ... 
On the structure of pathlike trees
Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2007)
Article
Open AccessWe study the structure of pathlike trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of pathlike trees and we call such generalization ... 
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 ... 
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 ... 
Queen Labelings
Bloom, Gary; Lampis, Michael; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2008)
Article
Open AccessWe introduce and investigate the concept of Queen labeling a digraph and its connection to the wellknown nqueens problem. In the general case we obtain an upper bound on the size of a queen graph and show that it is ... 
Strong labelings of linear forests
Baca, Martin; Lin, Yu Qing; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (20091115)
Article
Open AccessA (p, q)graph G is called super edgemagic if there exists a bijective function f : V (G) ∪ E(G) → {1, 2, . . . , p+q} such that f(u)+f(v)+f(uv) is a constant for each uv ∈ E(G) and f(V (G)) = {1, 2, . . . , p}. In ... 
Super edgemagic models
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (20110420)
Article
Open AccessIn this paper, we generalize the concept of super edgemagic graph by introducing the new concept of super edgemagic models.