@article {IOPORT.05557962,
    author       = {Yao, Xiangjuan},
    title        = {Group connectivity of two kinds of graphs.},
    year         = {2008},
    journal      = {International Journal of Algebra},
    volume       = {2},
    number       = {17-20},
    issn         = {1312-8868},
    pages        = {875-879},
    publisher    = {Hikari Ltd, Ruse},
    abstract     = {Summary: Let $G$ be an undirected graph, $A$ be an (additive) abelian group and $A^* = A-\{0\}$. A graph $G$ is $A$-connected if $G$ has an orientation $D(G)$ such that for every function $b: V(G)\mapsto A$ satisfying $\sum_{v\in V(G)} b(v) =0$, there is a function $f: E(G)\mapsto A^*$ such that $\sum_{e\in E^+(v)} f(e) -\sum_{e\in E^-(v)} f(e) = b(v)$. For an abelian group $A$, let $\langle A\rangle$ be the family of graphs that are $A$-connected. The group connectivity number $\Lambda_g(G) = \min\{n:$ if $A$ is an abelian group with $|A|\geq n$, then $G\in \langle A\rangle\}$. In this paper, we give the group connectivity of two kinds of graphs.},
    identifier   = {05557962},
}