Name
Abstract | ||
|---|---|---|
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. We extend this notion to a more general one in this paper, namely a constant-sum flow. The constant under a constant-sum flow is called an index of G, and I(G) is denoted as the index set of all possible indices of G. Among others we obtain that the index set of a regular graph admitting a perfect matching is the set of all integers. We also completely determine the index sets of all r-regular graphs except that of 4k-regular graphs of even order, k ≥ 1. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-21204-8_20 | FAW-AAIM |
Keywords | Field | DocType |
constant sum flow,non-zero integer,edges incident,regular graph,perfect matching,undirected graph,index set,r-regular graph,possible index,zero-sum flow,constant-sum flow | Discrete mathematics,Comparability graph,Strongly regular graph,Combinatorics,Indifference graph,Line graph,Vertex (graph theory),Chordal graph,Nowhere-zero flow,Mathematics,Maximal independent set | Conference |
Volume | ISSN | Citations |
6681 | 0302-9743 | 5 |
PageRank | References | Authors |
0.51 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tao-Ming Wang | 1 | 59 | 12.79 |
| Shi-Wei Hu | 2 | 6 | 1.53 |