On 1-sum flows in undirected graphs
From MaRDI portal
Publication:2834760
DOI10.13001/1081-3810.3003zbMATH Open1350.05052arXiv1503.07131OpenAlexW2964286633MaRDI QIDQ2834760FDOQ2834760
Authors: S. Akbari, Klas Markström, S. Zare, S. Friedland 
Publication date: 24 November 2016
Published in: ELA. The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Abstract: Let G=(V,E) be a simple undirected graph. For a given set L of the real line, a function omega from E to L is called an L-flow. Given a vector gamma whose coordinates are indexed by V, we say that omega is a gamma-L-flow if for each v in V, the sum of the values on the edges incident to v is gamma(v). If gamma(v)=c, for all v in V, then the gamma-L-flow is called a c-sum L-flow. In this paper we study the existence of gamma-L-flows for various choices of sets L of real numbers, with an emphasis on 1-sum flows. Given a natural k number, a c-sum k-flow is a c-sum flow with values from the set {-1,1,...,1-k, k-1}. Let L be a subset of real numbers containing 0 and let L* be L minus 0 by L*. Answering a question from a recent paper we characterize which bipartite graphs admit a 1-sum R*-flow or a 1-sum Z*-flow. We also show that that every k-regular graph, with k either odd or congruent to 2 modulo 4, admits a 1-sum {-1, 0, 1}-flow.
Full work available at URL: https://arxiv.org/abs/1503.07131
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cites Work
- A Contribution to the Theory of Chromatic Polynomials
- Title not available (Why is that?)
- An introduction to the theory of graph spectra
- The Factorization of Linear Graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Flows and generalized coloring theorems in graphs
- Factors and factorizations of graphs. Proof techniques in factor theory
- Title not available (Why is that?)
- The 1-Factors of Oriented Graphs
- On zero-sum 6-flows of graphs
- Factors of regular graphs
- A note on zero-sum 5-flows in regular graphs
- Zero-sum flows in regular graphs
- Nowhere-zero 6-flows
- Spanning trees with pairwise nonadjacent endvertices
- On factors in random graphs
- On the extreme points of a certain convex polytope
- A generalization of 0-sum flows in graphs
Cited In (1)
This page was built for publication: On 1-sum flows in undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2834760)
