Search
Frustrated Alternating Tree
Last updated
Nov 1, 2022
# Definition
Suppose G is an Undirected Graph
Undirected Graph
Definition
Let V be a and suppose $E \subset \{\{v, w\} \in \mathcal{P}(V) : v, w \in V, v \neq...
11/7/2022
, M is a Matching
Matching
Definition
Let G=(V,E) be an . A is a M⊂E so that $\forall u...
11/7/2022
on G, and (T,r) is an M-alternating tree
Matching Alternating Tree
Definition
Suppose G is an and M is a on G. Suppose (T,r) is a of...
11/7/2022
. We say T is a Frustrated Alternating Tree
Frustrated Alternating Tree
Definition
Suppose G is an , M is a on G, and (T,r) is an M-alternating tre. We say...
11/7/2022
if ∀e∈E(G) s.t. e∩B(T)=∅, we have that e∩A(T)=∅. That is, each Graph Edge with a endpoint in B(T) has its other endpoint in A(T).
# Results