Exploració per autor "López Masip, Susana Clara"
Ara es mostren els items 13-25 de 25
-
Langford sequences and a product of digraphs
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (2015-12-07)
Article
Accés obertSkolem 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
Accés restringit per política de l'editorialIn 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
Accés obertIn 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, 2018-04-11)
Examen
Accés restringit a la comunitat UPC -
On the beta-number of forests with isomorphic components
Ichishima, R.; López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Oshima, Akito (2018)
Article
Accés obertThe 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 (super) Edge-Magic Crowns
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Prabu, M. (2017-01-06)
Article
Accés obertA 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 ... -
Perfect edge-magic graphs
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2014-01-01)
Article
Accés restringit per política de l'editorialThe 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)
Text en actes de congrés
Accés obertEl 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 ... -
Proposta d'activitats dirigides per a un curs de càlcul
López Masip, Susana Clara; Dalfó Simó, Cristina; Huemer, Clemens; Tramuns Figueras, Eulàlia (Universitat Politècnica de Catalunya, 2009)
Apunts
Accés obert -
Rainbow eulerian multidigraphs and the product of cycles
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (2016-01-01)
Article
Accés obertAn 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 ... -
Super edge-magic models
López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2011-04-20)
Article
Accés obertIn this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models. -
Vertex-transitive graphs that remain connected after failure of a vertex an its neighbors
Hamidoune, Yahya Ould; Lladó Sánchez, Ana M.; López Masip, Susana Clara (Wiley InterScience, 2010)
Article
Accés restringit per política de l'editorialA d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex ... -
Vertex-Transitive Graphs That Remain Connected After Failure of a Vertex and Its Neighbors
Hamidoune, Yahya Ould; Lladó Sánchez, Ana M.; López Masip, Susana Clara (Wiley InterScience, 2011-06)
Article
Accés restringit per política de l'editorialA d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex ...