Zero-Sum Flow Numbers of (2,3)-Graphs
碩士 === 國立交通大學 === 應用數學系所 === 104 === For an undirected graph G, let E(v) denote the set of edges incident on a vertex v ∈ V(G). A zero-sum flow is an assignment f of non-zero real numbers on the edges of G such that ∑ f (e) = 0 e∈E(v) for all v ∈ V(G). A zero-sum k-flow is a zero-sum flow wit...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/52341776784625336317 |