Skip to main content
Log in

Zero-Sum Flows in Regular Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

For an undirected graph G, a zero-sum flow is an assignment of non-zero real numbers to the edges, such that the sum of the values of all edges incident with each vertex is zero. It has been conjectured that if a graph G has a zero-sum flow, then it has a zero-sum 6-flow. We prove this conjecture and Bouchet’s Conjecture for bidirected graphs are equivalent. Among other results it is shown that if G is an r-regular graph (r ≥ 3), then G has a zero-sum 7-flow. Furthermore, if r is divisible by 3, then G has a zero-sum 5-flow. We also show a graph of order n with a zero-sum flow has a zero-sum (n + 3)2-flow. Finally, the existence of k-flows for small graphs is investigated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Akbari S., Ghareghani N., Khosrovshahi G.B., Mahmoody A.: On zero-sum 6-flows of graphs. Linear Algebra Appl. 430, 3047–3052 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alon N.: Combinatorial Nullstellensatz, Recent trends in combinatorics. Combin. Probab. Comput. 8(1–2), 7–29 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bouchet A.: Nowhere-zero integral flows on a bidirected graph. J. Combin. Theory Ser. B 34, 279–292 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  4. Graham R.L., Grötschel M., Lovász L.: Handbook of Combinatorics. The MIT Press/North-Holland, Amsterdam (1995)

    MATH  Google Scholar 

  5. Hall P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26–30 (1935)

    Article  MATH  Google Scholar 

  6. Jaeger F.: Flows and generalized coloring theorems in graphs. J. Combin. Theory Ser. B 26(2), 205–216 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  7. Seymour P.D.: Nowhere-zero 6-flows. J. Combin. Theory Ser. B 30(2), 130–135 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  8. Tutte W.T.: A contribution to the theory of chromatic polynomials. Can. J. Math. 6, 80–91 (1954)

    MATH  MathSciNet  Google Scholar 

  9. West D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2001)

    Google Scholar 

  10. Xu R., Zhang C.: On flows in bidirected graphs. Discrete Math. 299, 335–343 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Akbari.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Akbari, S., Daemi, A., Hatami, O. et al. Zero-Sum Flows in Regular Graphs. Graphs and Combinatorics 26, 603–615 (2010). https://doi.org/10.1007/s00373-010-0946-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-010-0946-5

Keywords

Mathematics Subject Classification (2000)

Navigation