Group connectivity of graphs-A nonhomogeneous analogue of nowhere-zero flow properties

François Jaeger*, Nathan Linial, Charles Payan, Michael Tarsi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

158 Scopus citations

Abstract

Let G = (V, E) be a digraph and f a mapping from E into an Abelian group A. Associated with f is its boundary ∂f, a mapping from V to A, defined by ∂f(x) = Σe leaving xf(e)-Σe entering xf(e). We say that G is A-connected if for every b: V → A with Σx ∈ Vb(x)=0 there is an f: E → A - {0} with b = ∂f. This concept is closely related to the theory of nowhere-zero flows and is being studied here in light of that theory.

Original languageAmerican English
Pages (from-to)165-182
Number of pages18
JournalJournal of Combinatorial Theory. Series B
Volume56
Issue number2
DOIs
StatePublished - Nov 1992

Fingerprint

Dive into the research topics of 'Group connectivity of graphs-A nonhomogeneous analogue of nowhere-zero flow properties'. Together they form a unique fingerprint.

Cite this