GATE Overflow - Recent questions in Graph Theory
http://gateoverflow.in/questions/mathematics/discrete-mathematics/graph-theory
Powered by Question2AnswerGraph_Theory
http://gateoverflow.in/108420/graph_theory
A graph has a degree sequence <1,1,2,2,3,3,3,3> the number of edges in the graph?<br />
<br />
a) 18 b)9 c)36 d)8Graph Theoryhttp://gateoverflow.in/108420/graph_theoryFri, 20 Jan 2017 15:37:57 +0000no. of edges
http://gateoverflow.in/108399/no-of-edges
A graph G has k isolated vertices and n + k vertices. The maximum number of edges graph G can have?<br />
<br />
a) n(n-1) b)n(n-1)/2) c) n(n-k+1)/2 d) n(n+k-1)/2Graph Theoryhttp://gateoverflow.in/108399/no-of-edgesFri, 20 Jan 2017 15:10:35 +0000Graphs
http://gateoverflow.in/108398/graphs
A sequence d = is graphic if there is a simple non-directed graph with degree sequence d then which one of the following sequences is graphic?<br />
<br />
a) (2, 3, 3, 4, 4, 5) b) (1, 3, 3, 3) c) (2, 3, 3, 4, 5, 6, 7) d) (2, 3, 3, 3, 3)Graph Theoryhttp://gateoverflow.in/108398/graphsFri, 20 Jan 2017 15:06:18 +0000Graph
http://gateoverflow.in/108395/graph
1. Suppose that G is a non-directed graph with 12 edges. Suppose that G has 6 vertices of degree 3 and the rest have degrees less than 3. The minimum number of vertices G can have?<br />
<br />
a) 2 b) 0 c)1 d)3<br />
<br />
I am getting 3..plz verifyGraph Theoryhttp://gateoverflow.in/108395/graphFri, 20 Jan 2017 15:03:54 +0000Graph Theory Problem-Test Series
http://gateoverflow.in/108391/graph-theory-problem-test-series
A Connected Graph has Cut edge, Then Graph has Cut vertex also.<br />
<br />
1. True<br />
<br />
2. False<br />
<br />
Choose Correct One.Graph Theoryhttp://gateoverflow.in/108391/graph-theory-problem-test-seriesFri, 20 Jan 2017 14:59:48 +0000GRAPH_degree seq
http://gateoverflow.in/108382/graph_degree-seq
Is there any simple graph with degree sequence<br />
<br />
<1,1,1,1,2,2,3,3,3,3>Graph Theoryhttp://gateoverflow.in/108382/graph_degree-seqFri, 20 Jan 2017 14:40:54 +0000When they don't mention type of tree then if it's mandatory to take 'Binary Tree'(Check Description)
http://gateoverflow.in/107483/when-mention-mandatory-take-binary-tree-check-description
<p><span class="marker">The minimum number of vertices having degree 1 in a tree of at least 10 vertices is ______________.</span></p>
<p>If we consider this question, then first answer comes in our mind is '2', right?</p>
<p>But what if Tree isn't binary?</p>
<p> if root node has 9 leaf nodes, so all those nodes having degree 1, right? So answer could be:<strong>9</strong></p>Graph Theoryhttp://gateoverflow.in/107483/when-mention-mandatory-take-binary-tree-check-descriptionWed, 18 Jan 2017 12:52:13 +0000Graph Theory
http://gateoverflow.in/107480/graph-theory
Let G be a undirected graph with 35 edges and degree of each vertex is at least 3 then maximum number of vertices possible in G is<br />
<br />
(A) 22<br />
(B) 23<br />
(C) 24<br />
(D) 25<br />
<br />
P.S. Explain with ease, if possible!Graph Theoryhttp://gateoverflow.in/107480/graph-theoryWed, 18 Jan 2017 12:45:46 +0000Graph Theory
http://gateoverflow.in/107221/graph-theory
How to learn and understand graph theory in 23 days i mean before gate exam? Can anybody help in this.Like there are many new terms bipartite graph etc etc i m not able to learn some complicated names ?<br />
<br />
Any video lectures or anything please help :)Graph Theoryhttp://gateoverflow.in/107221/graph-theoryTue, 17 Jan 2017 21:06:55 +0000MADE EASY TEST SERIES
http://gateoverflow.in/106729/made-easy-test-series
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=8856951113969376819"></p>Graph Theoryhttp://gateoverflow.in/106729/made-easy-test-seriesTue, 17 Jan 2017 07:01:48 +0000What is the expected length of the cycle containing vertex 1?
http://gateoverflow.in/106462/what-is-the-expected-length-of-the-cycle-containing-vertex-1
<p>A random permutation π of set[n] = {1, 2, …, n} can be represent by a directed graph on n vertices with directed arc (i, π<sub>i</sub>) where π<sub>i</sub> is the i<sup>th</sup> entry in the permutation. Observe that the resulting graph is just a collection of disjoint cycles.
<br>
What is the expected length of the cycle containing vertex 1?</p>
<ol>
<li> n(n-1)/2n</li>
<li> (n+1)/2n</li>
<li> ((n-1))/2</li>
<li> ((n+1))/2</li>
</ol>
<p> </p>
<p>/pls explain the question </p>Graph Theoryhttp://gateoverflow.in/106462/what-is-the-expected-length-of-the-cycle-containing-vertex-1Mon, 16 Jan 2017 13:54:25 +0000Testbook
http://gateoverflow.in/106414/testbook
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=9826512353065079146"></p>Graph Theoryhttp://gateoverflow.in/106414/testbookMon, 16 Jan 2017 12:30:45 +0000Non-isomorphic graphs
http://gateoverflow.in/105987/non-isomorphic-graphs
<p>How many <em><strong>non-isomorphic</strong></em> simple graph are there with <strong>N</strong> vertices, where <strong>N = 4 ?</strong></p>Graph Theoryhttp://gateoverflow.in/105987/non-isomorphic-graphsSun, 15 Jan 2017 15:37:27 +0000#nlc payment
http://gateoverflow.in/105975/%23nlc-payment
@ arjun sir for nlc application i have done sbi collect payment 2 days before but still nlc is showing fee paid status as not paid what to do nowGraph Theoryhttp://gateoverflow.in/105975/%23nlc-paymentSun, 15 Jan 2017 15:27:44 +0000Number of Sums
http://gateoverflow.in/105861/number-of-sums
<table style="width:100%">
</table>
<table style="width:100%">
<tbody>
<tr>
<td> </td>
<td>The function for finding the fibonacci series is given as follows :
<br>
<br>
<img alt="Image not present" src="http://s3-ap-southeast-1.amazonaws.com/gate-content-images/data/images/common/papers/partners/34/580/image033.png">
<br>
<br>
The number of additions taken in evaluating fib(5) is.</td>
</tr>
</tbody>
</table>
<p>Your Answer:
<br>
<br>
4
<br>
<br>
Correct Answer: 7 Status: incorrect</p>Graph Theoryhttp://gateoverflow.in/105861/number-of-sumsSun, 15 Jan 2017 11:51:57 +0000Which is maximum Planar graph whose Line Graph is Planar?(Check the answer)
http://gateoverflow.in/105345/which-maximum-planar-graph-whose-graph-planar-check-answer
Graph Theoryhttp://gateoverflow.in/105345/which-maximum-planar-graph-whose-graph-planar-check-answerSat, 14 Jan 2017 06:26:19 +0000How many maximum cycles possible in any Complete graph? (Check the Answer)
http://gateoverflow.in/105343/how-many-maximum-cycles-possible-complete-graph-check-answer
Graph Theoryhttp://gateoverflow.in/105343/how-many-maximum-cycles-possible-complete-graph-check-answerSat, 14 Jan 2017 06:20:45 +0000#Chromatic number , Planarity
http://gateoverflow.in/104130/%23chromatic-number-planarity
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number of G)<br />
<br />
a) 2<br />
<br />
b) 3<br />
<br />
c) 4<br />
<br />
d) None of these<br />
<br />
PS : (Explain: "every face is bordered by exactly 3 edges. ")Graph Theoryhttp://gateoverflow.in/104130/%23chromatic-number-planarityWed, 11 Jan 2017 15:09:19 +0000Test Book Test
http://gateoverflow.in/103993/test-book-test
An Undirected graph G with only one simple path between each pair of vertices has two vertices of degree 4, one vertex of degree 3 and two vertices of degree 2. Number of vertices of degree 1 are _____________ ?Graph Theoryhttp://gateoverflow.in/103993/test-book-testWed, 11 Jan 2017 09:55:37 +0000Graph
http://gateoverflow.in/103064/graph
<p style="text-align:center"><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=112934128026092186"></p>Graph Theoryhttp://gateoverflow.in/103064/graphMon, 09 Jan 2017 11:08:49 +0000if graph is loop free then how can it have cycle
http://gateoverflow.in/101745/if-graph-is-loop-free-then-how-can-it-have-cycle
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=17020158051302376799"></p>Graph Theoryhttp://gateoverflow.in/101745/if-graph-is-loop-free-then-how-can-it-have-cycleFri, 06 Jan 2017 17:22:05 +0000graph
http://gateoverflow.in/101041/graph
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.Graph Theoryhttp://gateoverflow.in/101041/graphThu, 05 Jan 2017 11:13:58 +0000graph theory
http://gateoverflow.in/100206/graph-theory
Assumed undirected graph G is connected. G has 6vertices and 10 edges. Find<br />
the minimum number of edges whose deletion from graph G is always guarantee<br />
that it will become disconnected.Graph Theoryhttp://gateoverflow.in/100206/graph-theoryTue, 03 Jan 2017 20:57:09 +0000handshake lemma
http://gateoverflow.in/100080/handshake-lemma
<p>every vertex has a minimum degree, therefore, least number of edges that will be in the graph is given by the handshaking lemma as = <em>m</em><em>i</em><em>n</em>×|<em>v</em>|/2=2 E is right?</p>
<p> </p>
<p> </p>Graph Theoryhttp://gateoverflow.in/100080/handshake-lemmaTue, 03 Jan 2017 14:33:26 +0000Maths: Graph Theory
http://gateoverflow.in/99639/maths-graph-theory
<p>Let G be a graph with 10 vertices and 31 edges. If G has 3 vertices of degree 10, 1 vertex of degree 8 and 2 vertices of degree 5 and the other four vertices of degree at least 3, how many vertices are of degree 3________?</p>
<p>my solution:
<br>
<br>
Σ deg(v) = 2|E|</p>
<p>3*10 + 1*8 + 2*5 + 4*(>=3) = 2*31
<br>
<br>
4*(>=3) = 62- (30+8+10) = 14
<br>
<br>
I think we can have 3 vertices each of degree 3 and vertex of degree 5, so my answer is 3 but given answer is 2.
<br>
<br>
<span class="marker">Given answer: 2</span></p>Graph Theoryhttp://gateoverflow.in/99639/maths-graph-theoryMon, 02 Jan 2017 16:12:18 +0000Maths: Functions
http://gateoverflow.in/99351/maths-functions
<p>if $f(x)=\frac{x-1}{x+1}$ , x∈R-{-1}, then f<sup>-1</sup>(x) is equal to</p>
<p> </p>
<p>$a. \frac{x-1}{x+1} b.\frac{x+1}{x-1} c.\frac{2}{1+x}$ d.Does Not exist</p>Graph Theoryhttp://gateoverflow.in/99351/maths-functionsMon, 02 Jan 2017 05:41:33 +0000How this statement is true
http://gateoverflow.in/99316/how-this-statement-is-true
How this is true ?<br />
<br />
$_{r}^{\frac{n(n-1)}{2}}\textrm{C} = 2^{\frac{n(n-1))}{2}}$Graph Theoryhttp://gateoverflow.in/99316/how-this-statement-is-trueMon, 02 Jan 2017 04:12:10 +0000MATCHING NUMBER
http://gateoverflow.in/98836/matching-number
what is the matching number of $K_{2,3}$ graph.and also explain matching number of $K_{m,n}$(simplification).Graph Theoryhttp://gateoverflow.in/98836/matching-numberSat, 31 Dec 2016 09:58:55 +0000A graph $G$ is Eulerian path iff degree of each vertex is even with atmost one trivial component
http://gateoverflow.in/98763/graph-eulerian-degree-vertex-with-atmost-trivial-component
<p>For this proof ,proving</p>
<p>$\Rightarrow$ If Graph $G$ is eulerian then degree of each vertex is even with atmost one trivial component.</p>
<p>As $G$ is Eulerian ,it means it **must not** repeat Edges but can repeat vertices.Now for the Eulerian (path) traversal ,we pass through that vertex using two incident edges,one for entry and other for exit.</p>
<p> </p>
<p> </p>
<p>Then what is wrong in this graph?</p>
<p> </p>
<p><img alt="" height="174" src="http://gateoverflow.in/?qa=blob&qa_blobid=9141544755438812825" width="468"></p>
<p> </p>
<p>Here we have Eulerian path traversal as</p>
<p>
<br>
$C\rightarrow A \rightarrow B \rightarrow D \rightarrow C \rightarrow F \rightarrow E \rightarrow H \rightarrow G \rightarrow F $</p>
<p>but here degree of $C,F =3$ contradictory....</p>
<p>
<br>
help me out where i am wrong</p>
<p> </p>Graph Theoryhttp://gateoverflow.in/98763/graph-eulerian-degree-vertex-with-atmost-trivial-componentSat, 31 Dec 2016 07:28:13 +0000graph theory
http://gateoverflow.in/97768/graph-theory
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=11696266218365235197"></p>Graph Theoryhttp://gateoverflow.in/97768/graph-theoryWed, 28 Dec 2016 13:48:36 +0000[Rosen Textbook Problem] Complementary Graph
http://gateoverflow.in/97560/rosen-textbook-problem-complementary-graph
The complementary graph G' of a simple graph G has the same vertices as G. Two vertices are adjacent in G' if and only if they are not adjacent in G. Define Qn' (Hypercube complement).<br />
<br />
Answer given :-The graph whose vertices are bit strings of length n and two vertices are adjacent if the bit string represented by them differe by more than one bit.<br />
<br />
I want to understand that whether the complement graph will have self loops?Because the answer given doesn't consider self loops.I mean why are we not considering the bit strings that are differing by 0 bit,as these are also not there in original graph ,so it must be in complementary graph?Graph Theoryhttp://gateoverflow.in/97560/rosen-textbook-problem-complementary-graphTue, 27 Dec 2016 23:53:29 +0000planar region
http://gateoverflow.in/96892/planar-region
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=7262737156748786251"></p>
<p> </p>
<ul>
<li>How many planar regions?</li>
<li>How many closed regions? and how many are unbounded?</li>
<li>How many of then are bounded by a cycle of length $4$ ?</li>
<li>Now, for example (a different question, not related to above diagram ) a question says, In a connected 3 regular graph, every planar region is bounded by exactly 5 edges, then count no of edges?</li>
</ul>
<p>Please explain the last QS with the help of Euler's equation. </p>Graph Theoryhttp://gateoverflow.in/96892/planar-regionMon, 26 Dec 2016 09:18:35 +0000connectivity
http://gateoverflow.in/96717/connectivity
<p>Consider a simple connected undirected graph <em>G</em> which has m vertices and n edges. Which of the following condition always guarantee that after removal of those number of edges graph will be disconnected?</p>
<p><em>a)m</em> – <em>n</em> + 2</p>
<p>b)$_{2}^{m}\textrm{C}-n+2$</p>
<p> <em>c)n</em> – 2</p>
<p>d)None of the above</p>Graph Theoryhttp://gateoverflow.in/96717/connectivityMon, 26 Dec 2016 02:11:12 +0000E = 2N -3
http://gateoverflow.in/96274/e-2n-3
<p>I read in <a rel="nofollow" href="http://gateoverflow.in/28955/given-vertex-edges-how-find-non-isomorphic-graphs-possible">http://gateoverflow.in/28955/given-vertex-edges-how-find-non-isomorphic-graphs-possible</a> question explanantion,it was written that e=2n-3 where e= number of edges and n is no of vertices.</p>
<p>how is it derived??can anyone tell me the source??</p>Graph Theoryhttp://gateoverflow.in/96274/e-2n-3Sat, 24 Dec 2016 15:57:38 +0000maths
http://gateoverflow.in/96149/maths
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=6880132629596798735"></p>Graph Theoryhttp://gateoverflow.in/96149/mathsSat, 24 Dec 2016 09:52:05 +0000TIFR2017-B-13
http://gateoverflow.in/95821/tifr2017-b-13
<p>For an undirected graph $G=(V, E)$, the line graph $G'=(V', E')$ is obtained by replacing each edge in $E$ by a vertex, and adding an edge between two vertices in $V'$ if the corresponding edges in $G$ are incident on the same vertex. Which of the following is TRUE of line graphs?</p>
<ol style="list-style-type:upper-alpha">
<li>the line graph for a complete graph is complete</li>
<li>the line graph for a connected graph is connected</li>
<li>the line graph for a bipartite graph is bipartite </li>
<li>the maximum degree of any vertex in the line graph is at most the maximum degree in the original graph</li>
<li>each vertex in the line graph has degree one or two</li>
</ol>Graph Theoryhttp://gateoverflow.in/95821/tifr2017-b-13Fri, 23 Dec 2016 12:02:47 +0000TIFR2017-B-12
http://gateoverflow.in/95819/tifr2017-b-12
<p>An undirected graph is complete if there is an edge between every pair of vertices. Given a complete undirected graph on $n$ vertices, in how many ways can you choose a direction for the edges so that there are no directed cycles?</p>
<ol style="list-style-type:upper-alpha">
<li>$n$</li>
<li>$\frac{n(n-1)}{2}$</li>
<li>$n!$</li>
<li>$2^n$</li>
<li>$2^m, \: \text{ where } m=\frac{n(n-1)}{2}$</li>
</ol>Graph Theoryhttp://gateoverflow.in/95819/tifr2017-b-12Fri, 23 Dec 2016 11:58:27 +0000TIFR2017-B-10
http://gateoverflow.in/95817/tifr2017-b-10
<p>A vertex colouring of a graph $G=(V, E)$ with $k$ coulours is a mapping $c: V \rightarrow \{1, \dots , k\}$ such that $c(u) \neq c(v)$ for every $(u, v) \in E$. Consider the following statements:</p>
<ol style="list-style-type:lower-roman">
<li>If every vertex in $G$ has degree at most $d$ then $G$ admits a vertex coulouring using $d+1$ colours.</li>
<li>Every cycle admits a vertex colouring using 2 colours</li>
<li>Every tree admits a vertex colouring using 2 colours</li>
</ol>
<p>Which of the above statements is/are TRUE? Choose from the following options:</p>
<ol style="list-style-type:upper-alpha">
<li>only i</li>
<li>only i and ii</li>
<li>only i and iii</li>
<li>only ii and iii</li>
<li>i, ii, and iii</li>
</ol>Graph Theoryhttp://gateoverflow.in/95817/tifr2017-b-10Fri, 23 Dec 2016 11:47:52 +0000TIFR2017-B-2
http://gateoverflow.in/95673/tifr2017-b-2
<p>Consider the following statements:</p>
<ol style="list-style-type:lower-roman">
<li>Checking if a given $undirected$ graph has a cycle is in $\mathsf{P}$</li>
<li>Checking if a given $undirected$ graph has a cycle is in $\mathsf{NP}$</li>
<li>Checking if a given $directed$ graph has a cycle is in $\mathsf{P}$</li>
<li>Checking if a given $directed$ graph has a cycle is in $\mathsf{NP}$</li>
</ol>
<p>Which of the above statements is/are TRUE? Choose from the following options.</p>
<ol style="list-style-type:upper-alpha">
<li>Only i and ii</li>
<li>Only ii and iv</li>
<li>Only ii, iii, and iv</li>
<li>Only i, ii and iv</li>
<li>All of them</li>
</ol>Graph Theoryhttp://gateoverflow.in/95673/tifr2017-b-2Fri, 23 Dec 2016 06:15:20 +0000TIFR2017-B-1
http://gateoverflow.in/95669/tifr2017-b-1
<p>A vertex colouring with three colours of a graph $G=(V, E)$ is a mapping $c: V \rightarrow \{R, G, B\}$ so that adjacent vertices receive distinct colours. Consider the following undirected graph.</p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=12791582196260308825"></p>
<p>How many<span class="marker"> vertex colouring</span> with three colours does this graph have?</p>
<ol style="list-style-type:upper-alpha">
<li>$3^9$</li>
<li>$6^3$</li>
<li>$3 \times 2^8$</li>
<li>$27$</li>
<li>$24$</li>
</ol>Graph Theoryhttp://gateoverflow.in/95669/tifr2017-b-1Fri, 23 Dec 2016 06:09:43 +0000GATE1988-13iii
http://gateoverflow.in/94636/gate1988-13iii
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=11769911094076315028"></p>
<p>Are the two diagraphs shown in the above figure isomorohic? Justify your answer.</p>Graph Theoryhttp://gateoverflow.in/94636/gate1988-13iiiTue, 20 Dec 2016 05:02:50 +0000Planar graph || Kenneth
http://gateoverflow.in/94567/planar-graph-kenneth
<p>A planar graph has,</p>
<ul>
<li>$\large\color{maroon}{\text{k}}$ connected components</li>
<li>$\large\color{maroon}{\text{v}}$ vertices</li>
<li>$\large\color{maroon}{\text{e}}$ edges</li>
</ul>
<p>If the plane is divided into $\large\color{maroon}{\text{r}}$ regions then, what is the retation between $\large\color{maroon}{\text{k}}$ , $\large\color{maroon}{\text{v}}$ , $\large\color{maroon}{\text{e}}$ and $\large\color{maroon}{\text{r}}$ ?</p>Graph Theoryhttp://gateoverflow.in/94567/planar-graph-kennethMon, 19 Dec 2016 21:36:47 +0000GATE1988-2xvi
http://gateoverflow.in/94340/gate1988-2xvi
<p>Write the adjacency matrix representation of the graph given in below figure.</p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=8520460263129460510"></p>Graph Theoryhttp://gateoverflow.in/94340/gate1988-2xviMon, 19 Dec 2016 06:59:38 +0000eularian circuit
http://gateoverflow.in/92033/eularian-circuit
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the circuit a->b->c->a is not same as b->c->a->b]Graph Theoryhttp://gateoverflow.in/92033/eularian-circuitMon, 12 Dec 2016 10:53:01 +0000graph
http://gateoverflow.in/92032/graph
Which of the following statements is/are TRUE?<br />
[P] Every disconnected graph has an isolated vertex<br />
[Q] A graph is connected if and only if some vertex is connected to all other vertices<br />
[R] The edge set of every closed trail can be partitioned into edge sets of cycles<br />
[S] If a maximal trail in a graph is not closed, then its endpoints have odd degreeGraph Theoryhttp://gateoverflow.in/92032/graphMon, 12 Dec 2016 10:50:24 +0000Graph theory
http://gateoverflow.in/92030/graph-theory
proof :- A connected graph any two paths of maximum length share at least one vertexGraph Theoryhttp://gateoverflow.in/92030/graph-theoryMon, 12 Dec 2016 10:39:47 +0000eularian circuit
http://gateoverflow.in/91897/eularian-circuit
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the circuit a->b->c->a is not same as b->c->a->b]Graph Theoryhttp://gateoverflow.in/91897/eularian-circuitSun, 11 Dec 2016 22:41:29 +0000Hamiltonian cycles
http://gateoverflow.in/91896/hamiltonian-cycles
Number of distinct Hamiltonian cycles are there in a unlabeled complete graph K6______ [Note : the path a->b->c is same as b->c->a]Graph Theoryhttp://gateoverflow.in/91896/hamiltonian-cyclesSun, 11 Dec 2016 22:39:42 +0000Planar graph
http://gateoverflow.in/91894/planar-graph
The total number of planar graphs can be formed with 5 vertices are _____Graph Theoryhttp://gateoverflow.in/91894/planar-graphSun, 11 Dec 2016 22:31:22 +0000Directed graph
http://gateoverflow.in/91893/directed-graph
How many distinct directed graphs are there nodes labeled 1, 2, 3, 4? [consider graphs with no multiple edges and loops]Graph Theoryhttp://gateoverflow.in/91893/directed-graphSun, 11 Dec 2016 22:30:23 +0000