edited by
491 views
2 votes
2 votes

In Narsingh Deo, Walk is defined as "no edge appears (is covered or traversed) in more than 1 walk" but I studied that walk can have repeated edges. Is there a mistake in Narsingh Deo or I am missing some point?

edited by

1 Answer

2 votes
2 votes

points given in standard books like naransing deo can never be wrong ...leaving that apart ...

These are terminologies which vary from book to book which is even mentioned in kenneth rosen textbook.dont worry no definition is standard,incase if a question comes from this,they will clearly mention in the question what do they really mean by walk ...this is a screenshot taken from kenneth rosen textbook .

Related questions

1 votes
1 votes
1 answer
2
prabhas44 asked Jul 18, 2017
1,246 views
0 votes
0 votes
1 answer
3
lifeisshubh asked Jan 30, 2017
318 views
What should be the maximum lenght of path consisting of n veritces ?Is, it should be n or n-1.
1 votes
1 votes
2 answers
4
dhingrak asked Nov 29, 2014
1,132 views
Can anone please explain what is a perfect matching in graph theory?