Nowhere-zero flows in signed graphs: A survey
T Kaiser, E Rollová, R Lukot'ka - arXiv preprint arXiv:1608.06944, 2016 - arxiv.org
Nowhere-zero flows in signed graphs: A survey arXiv:1608.06944v1 [math.CO] 24 Aug 2016
Page 1 Nowhere-zero flows in signed graphs: A survey Tomáš Kaiser ∗ Robert Lukot’ka † Edita …
Page 1 Nowhere-zero flows in signed graphs: A survey Tomáš Kaiser ∗ Robert Lukot’ka † Edita …
Zero-sum flow numbers of hexagonal grids
TM Wang, GH Zhang - Frontiers in Algorithmics and Algorithmic Aspects in …, 2013 - Springer
As an analogous concept of nowhere-zero flows for directed and bi-directed graphs, we
consider zero-sum flows for undirected graphs in this article. For an undirected graph G, a …
consider zero-sum flows for undirected graphs in this article. For an undirected graph G, a …
Zero-sum flow numbers of triangular grids
As an analogous concept of a nowhere-zero flow for directed graphs, we consider zero-sum
flows for undirected graphs in this article. For an undirected graph G, a zero-sum flow is an …
flows for undirected graphs in this article. For an undirected graph G, a zero-sum flow is an …
[PDF][PDF] 0-Sum and 1-sum flows in regular graphs
Let $ G $ be a graph. Assume that $ l $ and $ k $ are two natural numbers. An $ l $-sum flow
on a graph $ G $ is an assignment of non-zero real numbers to the edges of $ G $ such that …
on a graph $ G $ is an assignment of non-zero real numbers to the edges of $ G $ such that …
[HTML][HTML] Zero-sum flows for triple systems
S Akbari, AC Burgess, P Danziger, E Mendelsohn - Discrete Mathematics, 2017 - Elsevier
Abstract Given a 2-(v, k, λ) design, S=(X, B), a zero-sum n-flow of S is a map f: B⟶{±1,…,±(n−
1)} such that for any point x∈ X, the sum of f over all the blocks incident with x is zero. It has …
1)} such that for any point x∈ X, the sum of f over all the blocks incident with x is zero. It has …
The complexity of the zero-sum 3-flows
A Dehghan, MR Sadeghi - Information Processing Letters, 2015 - Elsevier
A zero-sum k-flow for a graph G is a vector in the null-space of the 0, 1-incidence matrix of G
such that its entries belong to {±1,⋯,±(k− 1)}. Akbari et al.(2009)[5] conjectured that if G is a …
such that its entries belong to {±1,⋯,±(k− 1)}. Akbari et al.(2009)[5] conjectured that if G is a …
Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
Abstract A Not-All-Equal decomposition of a graph G is a decomposition of the vertices of G
into two parts such that each vertex in G has at least one neighbor in each part. Also, a 1-in …
into two parts such that each vertex in G has at least one neighbor in each part. Also, a 1-in …
[HTML][HTML] Zero-sum flows for Steiner systems
Given a t-(v, k, λ) design, D=(X, B), a zero-sum n-flow of D is a map f: B⟶{±1,…,±(n− 1)} such
that for any point x∈ X, the sum of f over all blocks incident with x is zero. For a positive …
that for any point x∈ X, the sum of f over all blocks incident with x is zero. For a positive …
On the algorithmic complexity of zero-sum edge-coloring
A Dehghan, MR Sadeghi - Information Processing Letters, 2016 - Elsevier
A zero-sum k-flow for a graph G is a vector in the null space of the 0, 1-incidence matrix of G
such that its entries belong to {±1,⋯,±(k− 1)}. Also, a zero-sum vertex k-flow is a vector in the …
such that its entries belong to {±1,⋯,±(k− 1)}. Also, a zero-sum vertex k-flow is a vector in the …