Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Ichishima, Rikio"'
A numbering $f$ of a graph $G$ of order $n$ is a labeling that assigns distinct elements of the set $\left\{ 1,2,\ldots ,n\right\} $ to the vertices of $G$, where each $uv\in E\left( G\right) $ is labeled $f\left( u\right) +f\left( v\right) $. The st
Externí odkaz:
http://arxiv.org/abs/2408.01475
A graph $G$ 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) \right\vert +\left\vert E\left( G\right) \right\vert \right\}$ such t
Externí odkaz:
http://arxiv.org/abs/2308.10661
A graph $G$ 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\vert +\left\vert E\left( G\right) \right\vert \right\}$ such that $f\lef
Externí odkaz:
http://arxiv.org/abs/2306.15986
A numbering $f$ of a graph $G$ of order $n$ is a labeling that assigns distinct elements of the set $\left\{ 1,2,\ldots ,n\right\} $ to the vertices of $G$. The strength $\textrm{str}_{f}\left( G\right)$ of a numbering $f:V\left( G\right) \rightarrow
Externí odkaz:
http://arxiv.org/abs/2304.00859
For all positive even integers $n$, graphs of order $n$ 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 study of a labeling problem in \cite{IMO}. This fact motivated the aut
Externí odkaz:
http://arxiv.org/abs/2303.07630
A graph $G$ 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\vert +\left\vert E\left( G\right) \right\vert \right\}$ such that $f\lef
Externí odkaz:
http://arxiv.org/abs/2211.04029
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics June 2019
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics March 2019
Autor:
Ichishima, Rikio, Oshima, Akito
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics December 2018 15(3):238-241
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 3, Pp 683-701 (2018)
The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, . . . , n} such that each uv ∈ E (G) is labeled |f (u) − f (v)| and the resulting set
Externí odkaz:
https://doaj.org/article/2dd4ad16a3c240c9b99a83a521d3c6f0