Abstract
As an analogous concept of a nowhere-zero flow for directed graphs, we consider zero-sum flows for undirected graphs in this article. For an undirected graph G, a zero-sum flow is an assignment of non-zero integers to the edges such that the sum of the values of all edges incident with each vertex is zero, and we call it a zero-sum k -flow if the values of edges are less than k. We define the zero-sum flow number of G as the least integer k for which G admitting a zero-sum k-flow. In this paper, among others we calculate the zero-sum flow numbers for regular graphs and also the zero-sum flow numbers for Cartesian products of regular graphs with paths.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akbari, S., Daemi, A., Hatami, O., Javanmard, A., Mehrabian, A.: Zero-Sum Flows in Regular Graphs. Graphs and Combinatorics 26, 603–615 (2010)
Akbari, S., Ghareghani, N., Khosrovshahi, G.B., Mahmoody, A.: On zero-sum 6-flows of graphs. Linear Algebra Appl. 430, 3047–3052 (2009)
Akbari, S., et al.: A note on zero-sum 5-flows in regular graphs. arXiv:1108.2950v1 [math.CO] (2011)
Bouchet, A.: Nowhere-zero integral flows on a bidirected graph. J. Combin. Theory Ser. B 34, 279–292 (1983)
Gallai, T.: On factorisation of grahs. Acta Math. Acad. Sci. Hung 1, 133–153 (1950)
Jaeger, F.: Flows and generalized coloring theorems in graphs. J. Combin. Theory Ser. B 26(2), 205–216 (1979)
Kano, M.: Factors of regular graph. J. Combin. Theory Ser. B 41, 27–36 (1986)
Petersen, J.: Die Theorie der regularen graphs. Acta Mathematica (15), 193–220 (1891)
Seymour, P.D.: Nowhere-zero 6-flows. J. Combin. Theory Ser. B 30(2), 130–135 (1981)
Tutte, W.T.: A contribution to the theory of chromatic polynomials. Can. J. Math. 6, 80–91 (1954)
Wang, T.-M., Hu, S.-W.: Constant Sum Flows in Regular Graphs. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 168–175. Springer, Heidelberg (2011)
Wang, T.-M., Hu, S.-W.: Nowhere-zero constant-sum flows of graphs. Presented in the 2nd India-Taiwan Conference on Discrete Mathematics, Coimbatore, Tamil Nadu, India (September 2011) (manuscript)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, TM., Hu, SW. (2012). Zero-Sum Flow Numbers of Regular Graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29700-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-29700-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29699-4
Online ISBN: 978-3-642-29700-7
eBook Packages: Computer ScienceComputer Science (R0)