6 citations · 10 across the 16 of their papers we have counts for
17 papers
Ramsey theory and strength of graphs
Rikio Ichishima, Francesc A Muntaner-Batle, Yukio Takahashi
A numbering of a graph of order is a labeling that assigns distinct elements of the set to the vertices of , where each $uv\in E\lef…
A method to compute the strength using bounds
Rikio Ichishima, Francesc A. Muntaner-Batle, Yukio Takahashi
A numbering of a graph of order is a labeling that assigns distinct elements of the set to the vertices of . The strength $\mathrm{str}\left(G\…
On the super edge-magicness of graphs with a specific degree sequence
Rikio Ichishima, Francesc A. Muntaner-Batle
A graph is said to be super edge-magic if there exists a bijective function $f:V\left(G\right) \cup E\left(G\right)\rightarrow \left\{1, 2, \ldots , \left\vert V\left( G\right)…
Some results concerning the valences of (super) edge-magic graphs
Yukio Takahashi, Francesc A. Muntaner-Batle, Rikio Ichishima
A graph is called edge-magic if there exists a bijective function $f:V\left(G\right) \cup E\left(G\right)\rightarrow \left\{1, 2, \ldots , \left\vert V\left( G\right) \right\ve…
On the strength and domination number of graphs
Yukio Takahashi, Rikio Ichishima, Francesc A. Muntaner-Batle
A numbering of a graph of order is a labeling that assigns distinct elements of the set to the vertices of . The strength $\textrm{s…
Non-isomorphic graphs with common degree sequences
Rikio Ichishima, Francesc A. Muntaner-Batle
For all positive even integers , graphs of order with degree sequence \begin{equation*} S_{n}:1,2,\dots,n/2,n/2,n/2+1,n/2+2,\dots,n-1 \end{equation*} naturally arose in the…
(Di)graph decompositions and magic type labelings: a dual relation
S. C. López, F. A. Muntaner-Batle, M. Prabu
A graph is called edge-magic if there is a bijective function from the set of vertices and edges to the set such that the sum $f(x)+f(xy)+f(y…
On the super edge-magicness of graphs of equal order and size
Susana-Clara López, Francesc-Antoni Muntaner-Batle, Mohan Prabu
The super edge-magicness of graphs of equal order and size has been shown to be important since such graphs can be used as seeds to answer many questions related to (super) edge-ma…
Characterizing path-like trees from linear configurations
Susana-Clara López, Francesc-Antoni Muntaner-Batle
Assume that we embed the path as a subgraph of a -dimensional grid, namely, . Given such an embedding, we consider the ordered set of subpaths $L_1, L_2, \…
New constructions for the -queens problem
Martin Bača, Susana-Clara López, Francesc-Antoni Muntaner-Batle +1
Let be a digraph, possibly with loops. A queen labeling of is a bijective function such that, for every pair of arcs in …
A new labeling construction from the -product
Susana-Clara López, Francesc-Antoni Muntaner-Batle, Mohan Prabu
The -product that refers the title was introduced in 2008 as a generalization of the Kronecker product of digraphs. Many relations among labelings have been obtained sin…
Perfect (super) edge-magic crowns
Susana-Clara López, Francesc-Antoni Muntaner-Batle, Mohan Prabu
In this paper we continue the study of the valences for (super) edge-magic labelings of crowns and we prove that the crowns are perfect (super) edge-ma…
Distance labelings: a generalization of Langford sequences
S. C. López, F. A. Muntaner-Batle
A Langford sequence of order and defect can be identified with a labeling of the vertices of a path of order in which each labeled from up to appears twice…
Langford sequences and a product of digraphs
Susana-Clara López, Francesc-Antoni Muntaner-Batle
Skolem and Langford sequences and their many generalizations have applications in numerous areas. The -product is a generalization of the direct product of digraphs. In…
A new application of the -product to -labelings
Susana-Clara López, Francesc-Antoni Muntaner-Batle
The weak tensor product was introduced by Snevily as a way to construct new graphs that admit -labelings from a pair of known -graphs. In this article, we show that this prod…
Rainbow eulerian multidigraphs and the product of cycles
Susana-Clara López, Francesc-Antoni Muntaner-Batle
An arc colored eulerian multidigraph with colors is rainbow eulerian if there is an eulerian circuit in which a sequence of colors repeats. The digraph product that refers…
Mirror bipartite graphs
Susana-Clara López, Francesc-Antoni Muntaner-Batle
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the ot…