2 votes 2 votes Find the number of paths of length n between two different vertices in K4 if n is a) 2. b) 3. c) 4. d) 5. Graph Theory kenneth-rosen discrete-mathematics graph-theory + – reena_kandari asked Aug 8, 2017 • recategorized Mar 5, 2019 by Pooja Khatri reena_kandari 1.2k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Habibkhan commented Aug 8, 2017 reply Follow Share Mathematical way of doing this : Create the adjacency matrix of K4 ..Say this is denoted as A..Then to find no of paths of length 2 , we find A2 , so A[i][j] entry of A2 will give number of paths of length 2 between vertices labelled 'i' and 'j'.. 1 votes 1 votes reena_kandari commented Aug 8, 2017 reply Follow Share yes habib, I understand this method of finding, but my main doubt is,As there is considerable variation of terminology concerning the concepts of PATH. a path can be simply a set of vertices(distinct or repeated ), but wiki and many other resources says "A path is a trail in which all vertices (except possibly the first and last) are distinct" unlike said in rosen.now which to consider while solving problems. 0 votes 0 votes amrendra pal commented Aug 20, 2017 reply Follow Share hello reena, i want to clear your doubt about HAMILTON PATH and HAMILTON CIRCUIT(CYCLE):- HAMILTON PATH: a simple path in a graph G that passes through every vertex exactly once is called HAMILTON PATH (i.e. in hamilton path starting and last vertex should be different.) HAMILTON CIRCUIT(CYCLE): a simple circuit in a graph G that passes through every vertex exactly once is called HAMILTON CIRCUIT (i.e. in hamilton circuit starting and last vertex should be same thats why it is called the circuit.) your doubt definately will be clear from this example:- 1 votes 1 votes Please log in or register to add a comment.