Name
Abstract | ||
|---|---|---|
As an analogous concept of a nowhere-zero flow for directed graphs, we consider zero-sum flows for undirected graphs in this article. For an undirected graph G , a zero-sum flow is an assignment of non-zero integers to the edges such that the sum of the values of all edges incident with each vertex is zero, and we call it a zero-sum k -flow if the values of edges are less than k . We define the zero-sum flow number of G as the least integer k for which G admitting a zero-sum k -flow. In this paper, among others we calculate the zero-sum flow numbers for regular graphs and also the zero-sum flow numbers for Cartesian products of regular graphs with paths. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-29700-7_25 | FAW-AAIM |
Keywords | Field | DocType |
cartesian product,analogous concept,edges incident,nowhere-zero flow,regular graph,undirected graph,zero-sum flow number,zero-sum k,integer k,zero-sum flow | Discrete mathematics,Strongly regular graph,Indifference graph,Combinatorics,Clique-sum,Chordal graph,Nowhere-zero flow,Robbins' theorem,Pathwidth,Mathematics,Dense graph | Conference |
Citations | PageRank | References |
6 | 0.51 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tao-Ming Wang | 1 | 59 | 12.79 |
| Shih-Wei Hu | 2 | 9 | 2.24 |