While going through the Introductory chapter of 'Graph Theory' by Bondy and Murty, I came across the definition of 'path' that says it's a sequence of vertices in such a way that two vertices are adjacent if they are consecutive in the sequence and non-adjacent otherwise.
However, on different sources I read that a path is just a sequence of vertices in such a way that two vertices are adjacent if consecutive and no vertex is repeated in the sequence.
I'm having trouble solving questions that involve the application of path. Kindly guide me through the correct definition of 'path' and why the definition is different in a standard text such as Bondy and Murty ?
Ahh, I think Bondy and Murty mean adjacent in the path if they are consecutive in the sequence, and non-adjacent otherwise. It's just their way of saying no vertex is repeated; if no vertex is repeated, then two vertices are adjacent in the sequence iff they are consecutive in the sequence. Conversely, if two vertices manage to be adjacent in a sequence without being consecutive in the sequence, that can only be because a vertex was repeated. (E.g., in the sequence $(a, b, c, d, b, e)$, the second and fourth elements are adjacent, despite being non-consecutive, only because $b$ is repeated.)
Frankly, I find the no-vertex-repeated statement more intuitive, but the definitions are identical.