Trees and Graph Components 1
Gilbert Lee · 2005
Let G be a graph. We say that G is connected if and only if: (Def. 1) For all vertices u, v of G holds there exists a walk of G which is walk from u to v. Let G be a graph. We say that G is acyclic if and only if: (Def. 2) There exists no walk of G which is cycle-like. Let G be a graph. We say that G is tree-like if and only if: This work has been partially supported by NSERC, Alberta Ingenuity Fund and iCORE. Part of author’s MSc work.