A note on zero-sum 5-flows in regular graphs
From MaRDI portal
Abstract: Let be a graph. A zero-sum flow in 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 be naturel number. A zero-sum -flow is a flow with value from the set . It has been conjectured that every -regular graph, , admits a zero-sum 5-flow. In this paper we give an affirmative answer to this conjecture, exept for r=5.
Recommendations
Cited in
(19)- Zero-sum flows in regular graphs
- Perfect matching and zero-sum 3-magic labeling
- Minimum flows in the total graph of a finite commutative ring
- Nowhere-zero unoriented 6-flows on certain triangular graphs
- Zero-sum magic labelings and null sets of regular graphs
- On the algorithmic complexity of zero-sum edge-coloring
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- Zero-sum flows for triple systems
- Nowhere-zero bases for the nullspace of the incidence matrices of graphs
- Circular zero-sum \(r\)-flows of regular graphs
- Constant sum flows in regular graphs
- Zero-sum 6-flows in 5-regular graphs
- The complexity of the zero-sum 3-flows
- 0-sum and 1-sum flows in regular graphs
- Zero-sum flow numbers of regular graphs
- Zero-sum flows of the linear lattice.
- Tutte's 5-flow conjecture for graphs of nonorientable genus 5
- On 1-sum flows in undirected graphs
- On zero-sum 6-flows of graphs
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)