Susana-Clara López

Learn More
We study the Häggkvist conjecture which states that, for each tree T with n edges, there is an edge-partition of the complete bipartite graph Kn;n into n isomorphic copies of T . We use the concept of bigraceful labelings, introduced in [7], which give rise to cyclic decompositions of Kn;n. When a tree T of size n is not known to be bigraceful it is shown,(More)
Figueroa-Centeno et al. introduced the following product of digraphs: let D be a digraph and let Γ be a family of digraphs such that V (F ) = V for every F ∈ Γ. Consider any function h : E(D) −→ Γ. Then the product D ⊗h Γ is the digraph with vertex set V (D) × V and ((a, x), (b, y)) ∈ E(D ⊗h Γ) if and only if (a, b) ∈ E(D) and (x, y) ∈ E(h(a, b)). In this(More)
The effects of the vital dye trypan blue (TpB) on the regeneration of amputated newt forelimbs were examined. Administration of the dye (10 mug/g body weight) via IP injection during the early wound healing and dedifferentiation phases of regeneration inhibited the normal regenerative response. The accumulation phases of regeneration are similarly halted(More)
A super edge-magic labeling of a graph G = (V, E) of order p and size q is a bijection f : V ∪E → {i} i=1 such that (1) f(u)+ f(uv)+ f(v) = k ∀uv ∈ E and (2) f(V ) = {i}pi=1. Furthermore, when G is a linear forest, the super edge-magic labeling of G is called strong if it has the extra property that if uv ∈ E(G), u′, v′ ∈ V (G) and dG(u, u′) = dG(v, v′) <(More)