✦ LIBER ✦

Zero-Sum Flows in Regular Graphs

✍ Scribed by S. Akbari; A. Daemi; O. Hatami; A. Javanmard; A. Mehrabian

Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 380 KB
Volume: 26
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0946-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On zero-sum -flows of graphs

✍ S. Akbari; N. Ghareghani; G.B. Khosrovshahi; A. Mahmoody 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 150 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

Nowhere-zero flows in low genus graphs

✍ Martina Möller; Hans Georg Carstens; Gunnar Brinkmann 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 274 KB 👁 1 views

Nowhere-zero flows in tensor product of

Nowhere-zero flows in tensor product of graphs

✍ Zhao Zhang; Yirong Zheng; Aygul Mamut 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB 👁 1 views

## Abstract In this paper, we characterize graphs whose tensor product admit nowhere‐zero 3‐flow. The main result is: For two graphs __G__~1~ and __G__~2~ with δ ≥ 2 and __G__~2~ not belonging to a well‐characterized class of graphs, the tensor product of __G__~1~ and __G__~2~ admits a nowhere‐zero

Nowhere-zero 3-flows in locally connecte

Nowhere-zero 3-flows in locally connected graphs

✍ Hong-Jian Lai 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB 👁 1 views

## Abstract Let __G__ be a graph. For each vertex __v__ ∈__V__(__G__), __N~v~__ denotes the subgraph induces by the vertices adjacent to __v__ in __G__. The graph __G__ is locally __k__‐edge‐connected if for each vertex __v__ ∈__V__(__G__), __N~v~__ is __k__‐edge‐connected. In this paper we study t