On $\gamma$-labelings of oriented graphs

Okamoto, Futaba, Zhang, Ping, and Saenpholphat, Varaporn. "On $\gamma $-labelings of oriented graphs." Mathematica Bohemica 132.2 (2007): 185-203. <http://eudml.org/doc/250253>.

@article{Okamoto2007,
abstract = {Let $D$ be an oriented graph of order $n$ and size $m$. A $\gamma $-labeling of $D$ is a one-to-one function $f\: V(D) \rightarrow \lbrace 0, 1, 2, \ldots , m\rbrace $ that induces a labeling $f^\{\prime \}\: E(D) \rightarrow \lbrace \pm 1, \pm 2, \ldots , \pm m\rbrace $ of the arcs of $D$ defined by $f^\{\prime \}(e) = f(v)-f(u)$ for each arc $e =(u, v)$ of $D$. The value of a $\gamma $-labeling $f$ is $\mathop \{\mathrm \{v\}al\}(f) = \sum _\{e \in E(G)\} f^\{\prime \}(e).$ A $\gamma $-labeling of $D$ is balanced if the value of $f$ is 0. An oriented graph $D$ is balanced if $D$ has a balanced labeling. A graph $G$ is orientably balanced if $G$ has a balanced orientation. It is shown that a connected graph $G$ of order $n \ge 2$ is orientably balanced unless $G$ is a tree, $n \equiv 2 \hspace\{4.44443pt\}(mod \; 4)$, and every vertex of $G$ has odd degree.},
author = {Okamoto, Futaba, Zhang, Ping, Saenpholphat, Varaporn},
journal = {Mathematica Bohemica},
keywords = {oriented graph; $\gamma $-labeling; balanced $\gamma $-labeling; balanced oriented graph; orientably balanced graph; balanced -labeling; balanced oriented graph; orientably balanced graph},
language = {eng},
number = {2},
pages = {185-203},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On $\gamma $-labelings of oriented graphs},
url = {http://eudml.org/doc/250253},
volume = {132},
year = {2007},
}

TY - JOUR
AU - Okamoto, Futaba
AU - Zhang, Ping
AU - Saenpholphat, Varaporn
TI - On $\gamma $-labelings of oriented graphs
JO - Mathematica Bohemica
PY - 2007
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 132
IS - 2
SP - 185
EP - 203
AB - Let $D$ be an oriented graph of order $n$ and size $m$. A $\gamma $-labeling of $D$ is a one-to-one function $f\: V(D) \rightarrow \lbrace 0, 1, 2, \ldots , m\rbrace $ that induces a labeling $f^{\prime }\: E(D) \rightarrow \lbrace \pm 1, \pm 2, \ldots , \pm m\rbrace $ of the arcs of $D$ defined by $f^{\prime }(e) = f(v)-f(u)$ for each arc $e =(u, v)$ of $D$. The value of a $\gamma $-labeling $f$ is $\mathop {\mathrm {v}al}(f) = \sum _{e \in E(G)} f^{\prime }(e).$ A $\gamma $-labeling of $D$ is balanced if the value of $f$ is 0. An oriented graph $D$ is balanced if $D$ has a balanced labeling. A graph $G$ is orientably balanced if $G$ has a balanced orientation. It is shown that a connected graph $G$ of order $n \ge 2$ is orientably balanced unless $G$ is a tree, $n \equiv 2 \hspace{4.44443pt}(mod \; 4)$, and every vertex of $G$ has odd degree.
LA - eng
KW - oriented graph; $\gamma $-labeling; balanced $\gamma $-labeling; balanced oriented graph; orientably balanced graph; balanced -labeling; balanced oriented graph; orientably balanced graph
UR - http://eudml.org/doc/250253
ER -