Diameter in Walk Graphs


A walk W of length k is admissible if every two consecutive edges of W are distinct. If G is a graph, then its walk graph Wk(G) has vertex set identical with the set of admissible walks of length k in G. Two vertices are adjacent in Wk(G) if and only if one of the corresponding walks can be obtained from the other by deleting an edge from one end and adding… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics