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

MaRDI QIDQ426866zbMATH OpenFDO

Authors S. Akbari, Narges Ghareghani, Gholamreza Khosrovshahi, S. Zare

Publication date 12 June 2012

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.2950, http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i2p7

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

regular graphzero-sum flow

Mathematics Subject Classification ID

Flows in graphs (05C21) Signed and weighted graphs (05C22)

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,\mathrm{...},pm(k-1)$. 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.

Recommendations

• Zero-sum 6-flows in 5-regular graphs
• 0-sum and 1-sum flows in regular graphs
• Zero-sum flows in regular graphs
• On zero-sum 6-flows of graphs
• Circular zero-sum r-flows of regular graphs

Cited in

(20)

• On zero-sum 6-flows of graphs
• Short circuit covers for regular matroids with a nowhere zero 5-flow
• Nowhere-zero unoriented 6-flows on certain triangular graphs
• Circular zero-sum r-flows of regular graphs
• Zero-sum 6-flows in 5-regular graphs
• On the algorithmic complexity of zero-sum edge-coloring
• On 1-sum flows in undirected graphs
• Zero-sum flow numbers of regular graphs
• 0-sum and 1-sum flows in regular graphs
• Constant sum flows in regular graphs
• Zero-sum magic labelings and null sets of regular graphs
• scientific article; zbMATH DE number 637539 (Why is no real title available?)
• Zero-sum flows of the linear lattice.
• The complexity of the zero-sum 3-flows
• Tutte's 5-flow conjecture for graphs of nonorientable genus 5
• Nowhere-zero bases for the nullspace of the incidence matrices of graphs
• Minimum flows in the total graph of a finite commutative ring
• Zero-sum flows in regular graphs
• Perfect matching and zero-sum 3-magic labeling
• Zero-sum flows for triple systems

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)