GATE Overflow - Recent questions tagged graph-matching
https://gateoverflow.in/tag/graph-matching
Powered by Question2Answergraph theory
https://gateoverflow.in/184693/graph-theory
Maximum no of edges in a triangle-free, simple planar graph with 10 verticesGraph Theoryhttps://gateoverflow.in/184693/graph-theorySat, 23 Dec 2017 10:38:59 +0000Matchings in a Graph
https://gateoverflow.in/174992/matchings-in-a-graph
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=1098626164388239596" style="float:left"></p>Graph Theoryhttps://gateoverflow.in/174992/matchings-in-a-graphWed, 29 Nov 2017 04:22:16 +0000chromatic number
https://gateoverflow.in/168890/chromatic-number
Let G be a planar Graph Such that every phase is bordered by exactly 3 edges which of the following can never be value for X(G)<br />
<br />
a)2 b)3 C)4 d)none of theseGraph Theoryhttps://gateoverflow.in/168890/chromatic-numberSat, 11 Nov 2017 16:26:00 +0000PERFECT MATCHING IN COMPLETE GRAPH
https://gateoverflow.in/166671/perfect-matching-in-complete-graph
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=1116234532547906579"></p>Graph Theoryhttps://gateoverflow.in/166671/perfect-matching-in-complete-graphMon, 06 Nov 2017 06:32:54 +0000Graph Theory
https://gateoverflow.in/151990/graph-theory
Consider a 'reversed Kruskal' Algorithm for computing a MST. Initialize T to be the set of all edges in the graph. Now consider edges from largest to smallest cost. For each edge, delete it from T if that edge belongs to a cycle in T. Assuming all the edge costs are distinct, does this new algorithm correctly compute a MST?<br />
<br />
<br />
<br />
a) Yes<br />
<br />
b) no<br />
<br />
c) cant sayGraph Theoryhttps://gateoverflow.in/151990/graph-theoryThu, 14 Sep 2017 03:24:49 +0000[Discrete Maths] Graph Theory Rosen,Chromatic number
https://gateoverflow.in/132851/discrete-maths-graph-theory-rosen-chromatic-number
<p>What are the chromatic number of following graphs?</p>
<p> </p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=2427432278983743495"></p>
<p>Answer is 6 and 4 respectively.But i am getting 3 for both.</p>
<p>Please someone confirm this?</p>Mathematical Logichttps://gateoverflow.in/132851/discrete-maths-graph-theory-rosen-chromatic-numberTue, 13 Jun 2017 03:38:59 +0000[Discrete maths] graph theory Perfect matching
https://gateoverflow.in/132353/discrete-maths-graph-theory-perfect-matching
When matching number and covering number are same then can we say that it is a perfect matching case?Do i need to check the elements of the set( edges in both matching and covering) also if their cardinality is same?If yes,then can someone give me an example where matching number and covering number same but still it is not a perfect match?I am not able to find such a case and i think it will not exist.Mathematical Logichttps://gateoverflow.in/132353/discrete-maths-graph-theory-perfect-matchingThu, 08 Jun 2017 20:41:26 +0000narsingh deo
https://gateoverflow.in/119875/narsingh-deo
In a village there are equal no of boys and girls of marriageable age.Each boy dates a certain no. of girls and each girl dates a certain number of boys,under what condition is it possible that every girl and boy gets married to one of their dates?Graph Theoryhttps://gateoverflow.in/119875/narsingh-deoMon, 27 Feb 2017 09:19:57 +0000made easy
https://gateoverflow.in/62631/made-easy
<p>Please explain how perfect matching in given tree is 1?</p>
<p>Why not 3 with edges ab,ce,df?</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=4504020862575904538"></p>
<p> </p>Mathematical Logichttps://gateoverflow.in/62631/made-easyWed, 10 Aug 2016 13:43:04 +0000VIRTUALGATE II Q.14
https://gateoverflow.in/37974/virtualgate-ii-q-14
<p>Find the matching number for the given graph-</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=11903843829953706322"></p>
Graph Theoryhttps://gateoverflow.in/37974/virtualgate-ii-q-14Tue, 26 Jan 2016 20:13:20 +0000Finding matching number of graph
https://gateoverflow.in/36597/finding-matching-number-of-graph
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=10063343342017607947"></p>
<p>Given explanation:</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=1899557196183761378"></p>
<p>In the above explanation, it is written that matching number is 4 but I am getting matching number as 3 for this graph(choosing edges 1-2, 3-4 and 6-7). Please check where I am going wrong</p>
Graph Theoryhttps://gateoverflow.in/36597/finding-matching-number-of-graphTue, 19 Jan 2016 03:17:35 +0000no of perfect matching in complete graph
https://gateoverflow.in/4788/no-of-perfect-matching-in-complete-graph
<p>Is there a way to find no of perfect matchings in a complete graph K<sub>n </sub>where n could be either even or odd..?</p>
Graph Theoryhttps://gateoverflow.in/4788/no-of-perfect-matching-in-complete-graphTue, 02 Dec 2014 06:46:43 +0000GATE2003-36
https://gateoverflow.in/926/gate2003-36
<p>How many perfect matching are there in a complete graph of $6$ vertices?</p>
<ol style="list-style-type: upper-alpha;">
<li>15</li>
<li>24</li>
<li>30</li>
<li>60</li>
</ol>Graph Theoryhttps://gateoverflow.in/926/gate2003-36Tue, 16 Sep 2014 23:36:22 +0000