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. Note that from algebraic point of view finding such zero-sum flows is the same as finding nowhere zero vectors in the null space of the incidence matrix of the graph. We consider in more details a combinatorial optimization problem, by defining the zero-sum flow number of G as the least integer k for which G admitting a zero-sum k-flow. It is well known that grids are extremely useful in all areas of computer science. Previously we studied flow numbers over hexagonal grids and obtained the optimal upper bound. In this paper, with new techniques we give completely zero-sum flow numbers for certain classes of triangular grid graphs, namely, regular triangular grids, triangular belts, fans, and wheels, among other results. Open problems are listed in the last section.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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. The Electronic Journal of Combinatorics 19(2), P7 (2012)
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.: Zero-Sum Flow Numbers of Regular Graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM 2012 and FAW 2012. LNCS, vol. 7285, pp. 269–278. Springer, Heidelberg (2012)
Wang, T.-M., Zhang, G.-H.: Zero-Sum Flow Numbers of Hexagonal Grids. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol. 7924, pp. 339–349. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, TM., Hu, SW., Zhang, GH. (2014). Zero-Sum Flow Numbers of Triangular Grids. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-08016-1_24
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08015-4
Online ISBN: 978-3-319-08016-1
eBook Packages: Computer ScienceComputer Science (R0)