On zero-sum 6-flows of graphs
From MaRDI portal
Publication:1020938
DOI10.1016/j.laa.2009.01.027zbMath1169.05326OpenAlexW2165662217MaRDI QIDQ1020938
Narges Ghareghani, Ahmad Mahmoody, Gholamreza Khosrovshahi, Saieed Akbari
Publication date: 4 June 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.01.027
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Related Items (22)
0-sum and 1-sum flows in regular graphs ⋮ On the algorithmic complexity of zero-sum edge-coloring ⋮ Nowhere-zero unoriented 6-flows on certain triangular graphs ⋮ Zero-sum flow number of categorical and strong product of graphs ⋮ Zero-sum flows in regular graphs ⋮ Circular zero-sum \(r\)-flows of regular graphs ⋮ Odd Decompositions of Eulerian Graphs ⋮ Nowhere-Zero Flows on Signed Eulerian Graphs ⋮ A generalization of 0-sum flows in graphs ⋮ Nowhere–zero bases for the nullspace of the incidence matrices of graphs ⋮ Zero-sum flows of the linear lattice. ⋮ The complexity of the zero-sum 3-flows ⋮ Zero-sum flow number of octagonal grid and generalized prism ⋮ Constant Sum Flows in Regular Graphs ⋮ Nowhere-zero eigenvectors of graphs ⋮ A new proof of validity of Bouchet's conjecture on Eulerian bidirected graphs ⋮ Minimum flows in the total graph of a finite commutative ring ⋮ Zero-sum flows for triple systems ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ Zero-sum flows in designs ⋮ Zero-sum 6-flows in 5-regular graphs ⋮ On 1-sum flows in undirected graphs
Cites Work
This page was built for publication: On zero-sum 6-flows of graphs
