Group connectivity of graphs—A nonhomogeneous analogue of nowhere-zero flow properties
نویسندگان
چکیده
منابع مشابه
Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties
Let G = (V, E) be a digraph and f a mapping from E into an Abelian group A. Associated with f is its boundary aS, a mapping from V to A, defined by af(x) = c Dleavingxf(e)-Ceenteringx f(e). We say that G is A-connected if for every b: V-, A with Cx E V b(x) = 0 there is an f: E -+ A (0) with b = af: This concept is closely related to the theory of nowhere-zero flows and is being studied here in...
متن کاملNowhere-zero flow polynomials
In this article we introduce the flow polynomial of a digraph and use it to study nowherezero flows from a commutative algebraic perspective. Using Hilbert’s Nullstellensatz, we establish a relation between nowhere-zero flows and dual flows. For planar graphs this gives a relation between nowhere-zero flows and flows of their planar duals. It also yields an appealing proof that every bridgeless...
متن کاملExtending a partial nowhere-zero 4-flow
In [J Combin Theory Ser B, 26 (1979), 205–216], Jaeger showed that every graph with 2 edge-disjoint spanning trees admits a nowhere-zero 4-flow. In [J Combin Theory Ser B, 56 (1992), 165–182], Jaeger et al. extended this result by showing that, if A is an abelian group with |A| = 4, then every graph with 2 edgedisjoint spanning trees is A-connected. As graphs with 2 edge-disjoint spanning trees...
متن کاملNowhere zero 4-flow in regular matroids
Jensen and Toft [10] conjectured that every 2-edge-connected graph without a K5minor has a nowhere zero 4-flow. Walton and Welsh [24] proved that if a coloopless regular matroid M does not have a minor in {M(K3,3),M(K5)}, then M admits a nowhere zero 4-flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K5),M(K5)}, then M admits a nowhere zero 4-flow....
متن کاملGroup Connectivity: $\mathbb Z_4$ v. $\mathbb Z_2^2$
We answer a question on group connectivity suggested by Jaeger et al. [Group connectivity of graphs – A nonhomogeneous analogue of nowhere-zero flow properties, JCTB 1992]: we find that Z2-connectivity does not imply Z4-connectivity, neither vice versa. We use a computer to find the graphs certifying this and to verify their properties using nontrivial enumerative algorithm. While the graphs ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1992
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90016-q