Zero-Sum Flow Numbers of Regular Graphs
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.
KeywordsDirected Graph Perfect Match Undirected Graph Regular Graph Edge Label
Unable to display preview. Download preview PDF.
- 3.Akbari, S., et al.: A note on zero-sum 5-flows in regular graphs. arXiv:1108.2950v1 [math.CO] (2011)Google Scholar
- 8.Petersen, J.: Die Theorie der regularen graphs. Acta Mathematica (15), 193–220 (1891)Google Scholar
- 12.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)Google Scholar
- 13.West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2001)Google Scholar