Now showing items 21-29 of 29

    • On Vosperian and Superconnected Vertex-Transitive Digraphs 

      Hamidoune, Yahya Ould; Lladó, Anna; López Masip, Susana-Clara (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 edge-magic labelings and related topics 

      López Masip, Susana-Clara; 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) Edge-Magic Crowns 

      López Masip, Susana-Clara; Muntaner Batle, Francesc Antoni; Prabu, M. (Springer, 2017)
      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 ...
    • Rainbow eulerian multidigraphs and the product of cycles 

      López Masip, Susana-Clara; 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 Figueroa-Centeno ...
    • Small cutsets in arc-transitive digraphs of prime degree 

      López Masip, Susana-Clara (Elsevier, 2013)
      We give an upper bound for the size of non-trivial sets that have small boundary in a family of arc-transitive digraphs. We state the exact size for these sets in case of prime degree. We also give a lower bound for the ...
    • Super edge-magic models 

      López Masip, Susana-Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (Springer, 2011)
      In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models.
    • The jumping knight and other (super) edge-magic constructions 

      López Masip, Susana-Clara; 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 edge-magic 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, Susana-Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (Elsevier, 2012)
      The ⊗h-product was introduced in 2008 by Figueroa-Centeno et al. as a way to construct new families of (super) edge-magic graphs and to prove that some of those families admit an exponential number of (super) edge-magic ...
    • Vertex‐transitive graphs that remain connected after failure of a vertex and its neighbors 

      Hamidoune, Yahya Ould; Lladó, Anna; López Masip, Susana-Clara (Wiley, 2011)
      A 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 ...