Browsing Articles publicats (Matemàtica) by Author "López Masip, SusanaClara"
Now showing items 2129 of 29

On Vosperian and Superconnected VertexTransitive Digraphs
Hamidoune, Yahya Ould; Lladó, Anna; López Masip, SusanaClara (Springer, 2013)We investigate the structure of a digraph having a transitive automorphism group where every cutset of minimal cardinality consists of all successors or all predecessors of some vertex. We give a complete characterization ... 
Open problems involving super edgemagic labelings and related topics
López Masip, SusanaClara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (Institute of Combinatorics and its Applications, 2012)Graph labelings has experimented a fast development during the last four decades. Two books dedicated to this topic, a very complete survey on the subject and over 1000 papers in the literature constitute a good proof of ... 
Perfect (super) EdgeMagic Crowns
López Masip, SusanaClara; Muntaner Batle, Francesc Antoni; Prabu, M. (Springer, 2017)A 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 ... 
Rainbow eulerian multidigraphs and the product of cycles
López Masip, SusanaClara; Muntaner Batle, Francesc Antoni (DMTCS, 2016)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 FigueroaCenteno ... 
Small cutsets in arctransitive digraphs of prime degree
López Masip, SusanaClara (Elsevier, 2013)We give an upper bound for the size of nontrivial sets that have small boundary in a family of arctransitive digraphs. We state the exact size for these sets in case of prime degree. We also give a lower bound for the ... 
Super edgemagic models
López Masip, SusanaClara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (Springer, 2011)In this paper, we generalize the concept of super edgemagic graph by introducing the new concept of super edgemagic models. 
The jumping knight and other (super) edgemagic constructions
López Masip, SusanaClara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (Springer, 2014)Let G be a graph of order p and size q with loops allowed. A bijective function f:V(G)∪E(G)→{i}p+qi=1 is an edgemagic labeling of G if the sum f(u)+f(uv)+f(v)=k is independent of the choice of the edge uv. The constant k ... 
The power of digraph products applied to labelings
Ichishima, R.; López Masip, SusanaClara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (Elsevier, 2012)The ⊗hproduct was introduced in 2008 by FigueroaCenteno et al. as a way to construct new families of (super) edgemagic graphs and to prove that some of those families admit an exponential number of (super) edgemagic ... 
Vertex‐transitive graphs that remain connected after failure of a vertex and its neighbors
Hamidoune, Yahya Ould; Lladó, Anna; López Masip, SusanaClara (Wiley, 2011)A dregular 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 ...