Browsing by Author "Rius Font, Miquel"

Now showing items 1-18 of 18

  • 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 ...

  • Characterizing Tractability by Tissue-Like P System 

    Gutiérrez Escudero, Rosa; Pérez Jiménez, Mario J.; Rius Font, Miquel (2010)
    Article
    Restricted access - publisher's policy
    In the framework of recognizer cell–like membrane systems it is well known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP–complete problems. Nonetheless, ...

  • Characterizing tractability by tissue-like P-systems 

    Rius Font, Miquel; Gutiérrez Escudero, Rosa; Pérez Jiménez, Mario J. (Springer, 2010)
    Part of book or chapter of book
    Restricted access - publisher's policy
    In the framework of recognizer cell–like membrane systems it is well known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP–complete problems. Nonetheless, ...

  • 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 ...

  • 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 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 ...

  • 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 ...

  • P Systems Computing the Period of Irreducible Markov Chains 

    Cardona Roca, Mónica; Colomer Cugat, M. Angeles; Riscos Núñez, Agustín; Rius Font, Miquel (2009-05-30)
    Article
    Open Access
    It is well known that any irreducible and aperiodic Markov chain has exactly one stationary distribution, and for any arbitrary initial distribution, the sequence of distributions at time n converges to the stationary ...

  • 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 ...

  • Strong labelings of linear forests 

    Baca, Martin; Lin, Yu Qing; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2009-11-15)
    Article
    Open Access
    A (p, q)-graph G is called super edge-magic 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 edge-magic models 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2011-04-20)
    Article
    Open Access
    In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models.

  • The efficiency of tissue P systems with cell separation relies on the environment 

    Macias Ramos, Luis F.; Pérez Jiménez, Mario J.; Riscos Nuñez, Agustín; Rius Font, Miquel; Valencia Cabrera, Luis (Springer, 2012)
    Conference report
    Restricted access - publisher's policy
    The classical definition of tissue P systems includes a distinguished alphabet with the special assumption that its elements are available in an arbitrarily large amount of copies. These objects are shared in a distinguished ...