%0 Journal Article
%T Full friendly index sets of slender and flat cylinder graphs
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Shiu, Wai Chee
%A Ho, Man-Ho
%D 2013
%\ 12/01/2013
%V 2
%N 4
%P 63-80
%! Full friendly index sets of slender and flat cylinder graphs
%K Full friendly index sets
%K friendly labeling
%K cylinder graphs
%R 10.22108/toc.2013.3678
%X Let $G=(V,E)$ be a connected simple graph. A labeling $f:V \to Z_2$ induces an edge labeling $f^*:E \to Z_2$ defined by $f^*(xy)=f(x)+f(y)$ for each $xy \in E$. For $i \in Z_2$, let $v_f(i)=|f^{-1}(i)|$ and $e_f(i)=|f^{*-1}(i)|$. A labeling $f$ is called friendly if $|v_f(1)-v_f(0)|\le 1$. The full friendly index set of $G$ consists all possible differences between the number of edges labeled by 1 and the number of edges labeled by 0. In recent years, full friendly index sets for certain graphs were studied, such as tori, grids $P_2\times P_n$, and cylinders $C_m\times P_n$ for some $n$ and $m$. In this paper we study the full friendly index sets of cylinder graphs $C_m\times P_2$ for $m\geq 3$, $C_m\times P_3$ for $m\geq 4$ and $C_3\times P_n$ for $n\geq 4$. The results in this paper complement the existing results in literature, so the full friendly index set of cylinder graphs are completely determined.
%U https://toc.ui.ac.ir/article_3678_3225bdc21d140f967414ef14f7247734.pdf