A note on zero-sum 5-flows in regular graphs

From MaRDI portal




Abstract: Let G be a graph. A zero-sum flow in G is an assignment of nonzero real number to the edges such that the sum of the values of all edges incident with each vertex is zero. Let k be naturel number. A zero-sum k-flow is a flow with value from the set pm1,pm2,...,pm(k1). It has been conjectured that every r-regular graph, rgeq3, admits a zero-sum 5-flow. In this paper we give an affirmative answer to this conjecture, exept for r=5.









This page was built for publication: A note on zero-sum 5-flows in regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426866)