5 papers · 1 filter
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…