Classification of Indecomposable Flows of Signed Graphs

Details Classification of Indecomposable Flows of Signed Graphs Classification of Indecomposable Flows of Signed Graphs

2011-12-03

arxiv.org/abs/1112.0642v1

Mathematics

Combinatorics

36 figures

Scientific paper

An indecomposable flow $f$ on a signed graph $\Sigma$ is a nontrivial integral flow that cannot be decomposed into $f=f_1+f_2$, where $f_1,f_2$ are nontrivial integral flows having the same sign (both $\geq 0$ or both $\leq 0$) at each edge of $\Sigma$. This paper is to classify indecomposable flows into characteristic vectors of circuits and Eulerian cycle-trees --- a class of signed graphs having a kind of tree structure in which all cycles can be viewed as vertices of a tree. Moreover, each indecomposable flow other than circuit characteristic vectors can be further decomposed into a sum of certain half circuit characteristic vectors having the same sign at each edge. The variety of indecomposable flows of signed graphs is much richer than that of ordinary unsigned graphs.

Affiliated with

Also associated with

No associations

Rating

Classification of Indecomposable Flows of Signed Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classification of Indecomposable Flows of Signed Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classification of Indecomposable Flows of Signed Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-697771