Now showing items 1-20 of 22

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

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (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 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Prabu, M. (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 ...
  • A note on the degree sequences of graphs with restrictions 

    Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2008-01-15)
    Article
    Open Access
    Degree sequences of some types of graphs will be studied and characterized in this paper.
  • Bi-magic and other generalizations of super edge-magic labelings 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (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 ...
  • Bounds on the size of super edge-magic graphs depending on the girth 

    Ichishima, Rikio; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2009-12-13)
    External research report
    Open Access
    Let G = (V,E) be a graph of order p and size q. It is known that if G is super edge-magic graph then q 2p−3. Furthermore, if G is super edge-magic 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 (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 ...
  • Distance labelings: a generalization of Langford sequences 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (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 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (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 

    Ahmad, Ali; López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (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 ...
  • Labeling Generating Matrices 

    Muntaner Batle, Francesc Antoni; Rius Font, Miquel; Ichishima, Rikio; Figueroa Centeno, Ramon M. (2006-09)
    Article
    Open Access
    This paper is mainly devoted to generate (special)(super) edge-magic labelings of graphs using matrices. Matrices are used in order to find lower bounds for the number of non-isomorphic (special)(super) edge-magic ...
  • Langford sequences and a product of digraphs 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (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 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (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 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (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 ...
  • On the beta-number of forests with isomorphic components 

    Ichishima, R.; López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Oshima, Akito (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)| ...
  • On the structure of path-like trees 

    Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2007)
    Article
    Open Access
    We study the structure of path-like 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 path-like trees and we call such generalization ...
  • Perfect edge-magic graphs 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (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 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Prabu, M. (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 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (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 ...
  • Queen Labelings 

    Bloom, Gary; Lampis, Michael; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2008)
    Article
    Open Access
    We introduce and investigate the concept of Queen labeling a digraph and its connection to the well-known n-queens problem. In the general case we obtain an upper bound on the size of a queen graph and show that it is ...
  • Rainbow eulerian multidigraphs and the product of cycles 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (2016-01-01)
    Article
    Open Access
    An arc colored eulerian multidigraph with l colors is rainbow eulerian if there is an eulerian circuit in which a sequence of l colors repeats. The digraph product that refers the title was introduced by Figueroa-Centeno ...