0 votes 0 votes What is meant by edge disjoint hamiltonian circuits in a graph Graph Theory graph-theory + – Winner asked Mar 4, 2019 Winner 774 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply prashant jha 1 commented Mar 5, 2019 reply Follow Share Two Hamiltonian Closed Walks having no edges in common . 1 votes 1 votes ankitgupta.1729 commented Mar 5, 2019 reply Follow Share edge-disjoint sub-graphs means we have $2$ or more than 2 sub-graphs in which edges are not common but vertices may be common between the sub-graphs. There is a theorem which tells if we have a complete graph $K_{n}$ where $n$ =odd then no. of edge-disjoint hamiltonian circuits in that graph will be $\frac{n-1}{2}$ Please check the example of edge-disjoint hamiltonian circuits :- 0 votes 0 votes prashant jha 1 commented Mar 5, 2019 reply Follow Share @ankitgupta.1729 Hamiltonian Circuit will always have all the vertices right ? Why have you written "may" contain? 0 votes 0 votes ankitgupta.1729 commented Mar 5, 2019 reply Follow Share @prashant jha 1 in case of hamiltonian graph , you are right. I said in general,in case of edge-disjoint sub-graphs. 0 votes 0 votes prashant jha 1 commented Mar 5, 2019 reply Follow Share @ankitgupta.1729 .. i beg your pardon :) 0 votes 0 votes ankitgupta.1729 commented Mar 5, 2019 reply Follow Share haha bro why ?.. Aisa nhi bolte bhai :) 0 votes 0 votes Winner commented Mar 5, 2019 reply Follow Share Thanks,got it 1 votes 1 votes prashant jha 1 commented Mar 5, 2019 reply Follow Share @ankitgupta.1729 arre bhai galat padhne ke liye :P 1 votes 1 votes Please log in or register to add a comment.