Group connectivity of certain graphs

  title={Group connectivity of certain graphs},
  author={Jingjing Chen and Elaine M. Eschen and Hong-Jian Lai},
  journal={Ars Comb.},
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 such that for every function b : V (G) 7→ A satisfying ∑ v∈V (G) b(v) = 0, there is a function f : E(G) 7→ A∗ such that at each vertex v ∈ V (G), the net flow out of v equals b(v). We investigate the group connectivity number Λg(G) = min{n : G is A-connected for every Abelian group with |A| ≥ n} for complete bipartite graphs, chordal graphs, and biwheels. 


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 14 references

Nowhere zero flow problems, in Selected Topics in Graph Theory, Vol. 3 (L

  • F. Jaeger
  • Beineke and R. Wilson,
  • 1988
Highly Influential
8 Excerpts

On minimum flow number of graphs

  • H. Shahmohamad
  • Bulletin of the ICA, 35
  • 2002
Highly Influential
4 Excerpts

On nowhere-zero flows

  • H. Shahmohamad
  • chromatic equivalence and chromatic equivalence…
  • 2000
Highly Influential
4 Excerpts

Integer Flows and Cycle Covers of Graphs

  • C.-Q. Zhang
  • Marcel Dekker, Inc.
  • 1997
Highly Influential
3 Excerpts

A contribution to the theory of chromatic polynomials

  • W. T. Tutte
  • Canad. J. Math., 6
  • 1954
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…