Cones of closed alternating walks and trails
Consider a graph whose edges have been colored red and blue. Assign a nonnegative real weight to every edge so that at every vertex, the sum of the weights of the incident red edges equals the sum of the weights of the incident blue edges. The set of all such assignments forms a convex polyhedral co...
Saved in:
Published in | Linear algebra and its applications Vol. 423; no. 2; pp. 351 - 365 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York, NY
Elsevier Inc
01.06.2007
Elsevier Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Consider a graph whose edges have been colored red and blue. Assign a nonnegative real weight to every edge so that at every vertex, the sum of the weights of the incident red edges equals the sum of the weights of the incident blue edges. The set of all such assignments forms a convex polyhedral cone in the edge space, called the
alternating cone. The integral (respectively, {0,
1}) vectors in the alternating cone are sums of characteristic vectors of closed alternating walks (respectively, trails). We study the basic properties of the alternating cone, determine its dimension and extreme rays, and relate its dimension to the majorization order on degree sequences. We consider whether the alternating cone has integral vectors in a given box, and use residual graph techniques to reduce this problem to the one of searching for an alternating trail connecting two given vertices. The latter problem, called
alternating reachability, is solved in a companion paper along with related results. |
---|---|
ISSN: | 0024-3795 1873-1856 |
DOI: | 10.1016/j.laa.2007.01.013 |