Những tài liệu gần giống với tài liệu bạn đang xem
A note on circuit graphs
We only consider finite graphs without loops or multiple edges. For a graph G, we useV (G) and E(G) to denote the vertex set and edge set of G, respectively. A k-walk in Gis a walk passing through every vertex of G at least once and at most k times.
pdf Đăng bởi
becauseiloveu0606
