A Sign-Balanced Index Set of Some Graphs
Abstract
Let $G(V,E)$ be a simple connected graph. Let $g:E(G)\rightarrow \{+, -\}$ be a sign edge labeling that induces a vertex labeling $h: V(G)\rightarrow \{+, -\}$ such that $h(q)=\prod_{p\in N(q)} g(pq)$, where $N(q)$ be the neighborhood of the vertex $q$. Let $e(-)=card\{e \in E :g(e)= -\}$, $e(+)=card\{e \in E:g(e)= + \}$ and $q(-)=card\{q \in V : h(q)= -\}$, $q(+)=card\{q \in V : h(q)= +\}$. A labeling $g$ is said to be sign friendly labeling if $\mid e(+) - e(-) \mid \leq 1$. The sign balanced index set $(SBIS)$ of a graph $G$ is defined by $\{\mid q(+) - q(-) \mid$ : the edge labeling $g$ is sign-friendly\}. In this study, we ascertain SBIS of $C_n \times P_2$, $B(n-1)$ and a wheel.