0 votes 0 votes Graph Matching was explained. Let $S$ and $R$ be the matching graph, then a new graph $G=(S-R) \cup (R-S)$, will be union of vertex disjoint path and cycle. Also prove that the cycle obtained will be of even length. Graph Theory iit-kanpur written-test mtech gate2017 + – rahul sharma 5 asked Mar 18, 2018 • edited Mar 25, 2018 by Sukanya Das rahul sharma 5 372 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply ankitgupta.1729 commented Mar 19, 2018 reply Follow Share @Rahul ,Could you please explain , what is matching graph ? and in IITs' interview , should we have to give formal proof or is it ok if we prove it by counterexamples ? 0 votes 0 votes rahul sharma 5 commented Mar 19, 2018 reply Follow Share I am not sure. I found this question in interview experience I copy pasted as it is. :( 1 votes 1 votes hungrysoul554 commented Apr 13, 2018 reply Follow Share @rahul sharma 5 could you provide the link to question where you have found ?? 0 votes 0 votes Please log in or register to add a comment.
