이언배 연구노트

Definitionwalk: sequence $v_1v_2...v_k$  of vertices and a sequence of edges $v_iv_{i+1} \in E(G)$. edge 로 건너건너Closed walk: $v_1 =v+k$. 어찌되었건 건너건너 돌아옴trail: all edges are distinct. Edge 안겹치고 건너건너closed trail: Edge 안겹치고 건너건너 돌아옴path: all vertices are distinct. Vertex 안겹치고 건너건너Cycle: closed walk 인데 vertex 안겹치고 건너건너 돌아옴.Length of the walk: k-1 G is connected: all pairs $u, v \in V(G)$, there is a p..