✦ LIBER ✦

On zero-sum -flows of graphs

✍ Scribed by S. Akbari; N. Ghareghani; G.B. Khosrovshahi; A. Mahmoody

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 150 KB
Volume: 430
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.01.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Zero-Sum Flows in Regular Graphs

✍ S. Akbari; A. Daemi; O. Hatami; A. Javanmard; A. Mehrabian 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 380 KB

Zero-sum flows in designs

✍ S. Akbari; G. B. Khosrovshahi; A. Mofidi 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

Let D be a t- (v, k,k) design and let N i (D), for 1 ≤ i ≤ t, be the higher incidence matrix of D, a (0, 1)-matrix of size v i×b , where b is the number of blocks of D. A zero-sum flow of D is a nowhere-zero real vector in the null space of N 1 (D). A zero-sum k-flow of D is a zero-sum flow with val

Nowhere-Zero Flows in Random Graphs

✍ Benny Sudakov 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 138 KB

A nowhere-zero 3-flow in a graph G is an assignment of a direction and a value of 1 or 2 to each edge of G such that, for each vertex v in G, the sum of the values of the edges with tail v equals the sum of the values of the edges with head v. Motivated by results about the region coloring of planar

On zero sum Ramsey numbers: Multiple cop

On zero sum Ramsey numbers: Multiple copies of a graph

✍ A. Bialostocki; P. Dierker 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 376 KB 👁 1 views

## Abstract As a consequence of our main result, a theorem of Schrijver and Seymour that determines the zero sum Ramsey numbers for the family of all __r__‐hypertrees on __m__ edges and a theorem of Bialostocki and Dierker that determines the zero sum Ramsey numbers for __r__‐hypermatchings are com

Zero-sum delta-systems and multiple copi

Zero-sum delta-systems and multiple copies of graphs

✍ Caro, Yair; Provstgaard, Christian 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB 👁 1 views

A main result proved in this paper is the following. Theorem. Let G be a noncomplete graph on n vertices with degree sequence where R is the zero-sum Ramsey number.

Zero-sum block designs and graph labelin

Zero-sum block designs and graph labelings

✍ Zsolt Tuza 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 621 KB

Proving a conjecture of Aigner and Triesch, we show that every graph G = (V,E) without isolated vertices and isolated edges admits an edge labeling 5: E -{0,1}" with binary vectors of length m = [log2 nl + 1 such that the sums 6 ( v ) := 1 ; ; ; &(e) (taken modulo 2 componentwise) are mutually disti