= = A wheel Wn = (V, E) is a graph defined by V = {vo, V1, ..., Vn} and E = {(vo, Vi): i = 1, n} U{(Vi, Vitl): i = 1, ..

[answerhappygod]

A Wheel Wn V E Is A Graph Defined By V Vo V1 Vn And E Vo Vi I 1 N U Vi Vitl I 1 1 (42.12 KiB) Viewed 24 times

= = A wheel Wn = (V, E) is a graph defined by V = {vo, V1, ..., Vn} and E = {(vo, Vi): i = 1, n} U{(Vi, Vitl): i = 1, ..., n - 1} U{(Vn, v,)}. Let P = {x E RIEI: (xe: e contains node \v) = 2 for all v EV, 0 < xe s 1 for all e EE. i) Find the dimension of P. ii) Show that the inequalities x, 20 are redundant. iii) Show that the inequalities Xę s 1 are redundant for e = (vo, V;) for i = 1, ..., n. iv) Give a minimal representation of P by a system of linear inequalities and equalities. v) Give a representation of P by means of its extreme points. =