Name
Abstract | ||
|---|---|---|
Let G be a graph. Assume that l and k are two natural numbers. An l-sum flow on a graph G is an assignment of non-zero real numbers to the edges of G such that for every vertex v of G the sum of values of all edges incident with v equals l. An l-sum k-flow is an l-sum flow with values from the set {+/- 1,...,+/-(k 1)}. Recently, it was proved that for every r, r,>= 3, r not equal 5, every r-regular graph admits a 0-sum 5-flow. In this paper we settle a conjecture by showing that every 5-regular graph admits a 0-sum 5-flow. Moreover, we prove that every r-regular graph of even order admits a 1-sum 5-flow. |
Year | Venue | Keywords |
|---|---|---|
2016 | ELECTRONIC JOURNAL OF COMBINATORICS | 0-sum flow,regular graph,1-sum flow,factor |
Field | DocType | Volume |
Discrete mathematics,Graph,Natural number,Combinatorics,Vertex (geometry),Regular graph,Real number,Conjecture,Mathematics | Journal | 23 |
Issue | ISSN | Citations |
2.0 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saieed Akbari | 1 | 140 | 35.56 |
| Mikio Kano | 2 | 548 | 99.79 |
| Sanaz Zare | 3 | 11 | 3.22 |