GATE Overflow - Recent questions tagged graph-connectivity
http://gateoverflow.in/tag/graph-connectivity
Powered by Question2Answergraph 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 +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 +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 +0000graph theory
http://gateoverflow.in/84795/graph-theory
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/84795/graph-theoryTue, 22 Nov 2016 07:25:21 +0000Doubt: Graph Theory
http://gateoverflow.in/80069/doubt-graph-theory
When say that with n vertices there are total 2^(n(n-1)/2) connected/disconnected graph possible, in this case we are assuming that vertices are labelled, right??<br />
<br />
<br />
<br />
Is there any formula to count number of connected/disconnected graphs possible with n unlabeled vertices?Graph Theoryhttp://gateoverflow.in/80069/doubt-graph-theoryTue, 08 Nov 2016 03:11:14 +0000Kerala PSC AP Exam
http://gateoverflow.in/77267/kerala-psc-ap-exam
The maximum number of edges in an acyclic undirected graph with n vertices<br />
<br />
A) n - 1<br />
<br />
B) n<br />
<br />
C) n +1<br />
<br />
D) 2n -1DShttp://gateoverflow.in/77267/kerala-psc-ap-examThu, 27 Oct 2016 16:53:07 +0000Graph theory
http://gateoverflow.in/76955/graph-theory
Decomposition of complete graph into cycles through all vertices.<br />
Continuing explanation [here][1],<br />
Next explanation is given as<br />
<br />
for $n=5$ , $n=7$, it suffices to use cycles formed by traversing the<br />
vertices with constant difference:$\left(0,1,2,3,4\right)$,$\left(0,2,4,1,3\right)$ for $n=5 $<br />
<br />
and<br />
<br />
$\left(0,1,2,3,4,5,6\right)$,$\left(0,3,6,2,5,1,4\right)$ for $n=7 $<br />
<br />
Not getting how <br />
$\left(0,1,2,3,4\right)$,$\left(0,2,4,1,3\right)$ and $\left(0,1,2,3,4,5,6\right)$,$\left(0,3,6,2,5,1,4\right)$ is coming from !!!!!<br />
<br />
Please help me out!!<br />
<br />
[1]: <a href="http://math.stackexchange.com/questions/1985647/decomposition-of-complete-graph-into-cycles-through-all-vertices/1985652#1985652" rel="nofollow" target="_blank">http://math.stackexchange.com/questions/1985647/decomposition-of-complete-graph-into-cycles-through-all-vertices/1985652#1985652</a>Graph Theoryhttp://gateoverflow.in/76955/graph-theoryWed, 26 Oct 2016 12:29:26 +0000Graph connectivity
http://gateoverflow.in/73128/graph-connectivity
<p><img alt="Loading Question" src="https://d2190hpfa85jkd.cloudfront.net/q/aa27563a2b91fc7079e234e2873059f7.jpg"></p>Graph Theoryhttp://gateoverflow.in/73128/graph-connectivityMon, 10 Oct 2016 12:53:34 +0000Gatebook
http://gateoverflow.in/63846/gatebook
<h2>Let A has n vertices. If Ā is connected graph then the maximum number of edges that A can have is</h2>
<h3>a) (n-1)(n-2)/2
<br>
b) n(n-1)/2
<br>
c) n-1
<br>
d) n</h3>Mathematical Logichttp://gateoverflow.in/63846/gatebookFri, 19 Aug 2016 11:33:49 +0000Graph Theory
http://gateoverflow.in/62888/graph-theory
consider the following statement-:<br />
<br />
1.If a graph has Euler circuit then it is Strongly Connected graph.<br />
<br />
2.If a graph has Euler path(but not Euler circuit) then it is Strongly Connected graph.<br />
<br />
3.If a graph has Euler circuit then it is Weakly Connected graph.<br />
<br />
4.If a graph has Euler path(but not euler circuit) then it is Weakly Connected graph.<br />
<br />
Which statement is true with proper explanation.Graph Theoryhttp://gateoverflow.in/62888/graph-theoryFri, 12 Aug 2016 04:39:13 +0000Graph theory
http://gateoverflow.in/62654/graph-theory
complement of a complete bipartite graph Km,n .please provide a figure for explanation.Graph Theoryhttp://gateoverflow.in/62654/graph-theoryWed, 10 Aug 2016 12:06:35 +0000UGCNET-Sep2013-II-20
http://gateoverflow.in/49362/ugcnet-sep2013-ii-20
<p>Consider the following statements:</p>
<ol style="list-style-type: upper-roman;">
<li>A graph in which there is a unique path between every pair of vertices is a tree.</li>
<li>A connected graph with e=v-1 is a tree</li>
<li>A connected graph with e=v-1 that has no circuit is a tree</li>
</ol>
<p>Which one of the above statements is/are true?</p>
<ol style="list-style-type: upper-alpha;">
<li>I and III</li>
<li>II and III</li>
<li>I and II</li>
<li>All of the above</li>
</ol>
DShttp://gateoverflow.in/49362/ugcnet-sep2013-ii-20Thu, 09 Jun 2016 07:44:47 +0000CMI2011-B-02b
http://gateoverflow.in/47081/cmi2011-b-02b
<p style="line-height: 20.8px;">Let $G$ be a connected graph. For a vertex $x$ of $G$ we denote by $G−x$ the graph formed by removing $x$ and all edges incident on $x$ from $G$. $G$ is said to be good if there are at least two distinct vertices $x, y$ in $G$ such that both $G − x$ and $G − y$ are connected.</p>
<ol style="line-height: 20.8px; list-style-type: lower-roman;">
<li>Given a good graph, devise a linear time algorithm to find two such vertices.</li>
</ol>
<p style="line-height: 20.8px;"> </p>
Graph Theoryhttp://gateoverflow.in/47081/cmi2011-b-02bFri, 27 May 2016 08:07:07 +0000CMI2011-B-02a
http://gateoverflow.in/46203/cmi2011-b-02a
<p>Let $G$ be a connected graph. For a vertex $x$ of $G$ we denote by $G−x$ the graph formed by removing $x$ and all edges incident on $x$ from $G$. $G$ is said to be good if there are at least two distinct vertices $x, y$ in $G$ such that both $G − x$ and $G − y$ are connected.</p>
<ol style="list-style-type: lower-roman;">
<li>Show that for any subgraph $H$ of $G$, $H$ is good if and only if $G$ is good.</li>
</ol>
Set Theory & Algebrahttp://gateoverflow.in/46203/cmi2011-b-02aThu, 19 May 2016 06:29:10 +0000CMI2011-A-07
http://gateoverflow.in/46194/cmi2011-a-07
<p>Let $G=(V, E)$ be a graph. Define $\bar{G}$ to be $(V, \bar{E})$, where for all $u, \: v \: \in V \: , (u, v) \in \bar{E}$ if and only if $(u, v) \notin E$. Then which of the following is true?</p>
<ol style="list-style-type: upper-alpha;">
<li>$\bar{G}$ is always connected.</li>
<li>$\bar{G}$ is connected if $G$ is not connected.</li>
<li>At least one of $G$ and $\bar{G}$ connected.</li>
<li>$G$ is not connected or $\bar{G}$ is not connected</li>
</ol>
Graph Theoryhttp://gateoverflow.in/46194/cmi2011-a-07Thu, 19 May 2016 06:10:12 +0000CMI2010-B-02
http://gateoverflow.in/46129/cmi2010-b-02
<p><span style="line-height: 20.8px;">Let $G$ be a graph in which each vertex has degree at least $k$. Show that there is a path of length $k$ in $G$—that is, a sequence of $k+1$ distinct vertices $v_0, v_1, \dots v_k$ such that for $0 \leq i < k,$ $v_i$ is connected to $v_{i+1}$ in $G$.</span></p>
Graph Theoryhttp://gateoverflow.in/46129/cmi2010-b-02Thu, 19 May 2016 00:48:54 +0000Connectivity Graph Theory
http://gateoverflow.in/45037/connectivity-graph-theory
Which of the following statements are true . Please explain why each statement is true/false..<br />
<br />
S1 : If a simple graph G is not connected then it's complement G is not connected<br />
<br />
S2 : If a simple graph G is connected them it's complement G is not connected<br />
<br />
S3 : A simple graph with n vertices is necessarily connected if min degree of a vertex = (n-1)/2<br />
<br />
S4 : If a simple graph has exactly two vertices of odd degree then there exists a path between two vertices of odd degreeGraph Theoryhttp://gateoverflow.in/45037/connectivity-graph-theoryFri, 06 May 2016 12:37:19 +0000GATE2015-1_54
http://gateoverflow.in/8364/gate2015-1_54
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/8364/gate2015-1_54Fri, 13 Feb 2015 23:25:13 +0000GATE2015-2_50
http://gateoverflow.in/8252/gate2015-2_50
<p>In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true?</p>
<p> </p>
<ol style="list-style-type:upper-alpha">
<li>A tree has no bridges</li>
<li>A bridge cannot be part of a simple cycle</li>
<li>Every edge of a clique with size ≥ 3 is a bridge (A clique is any complete subgraph of a graph)</li>
<li>A graph with bridges cannot have cycle</li>
</ol>
Graph Theoryhttp://gateoverflow.in/8252/gate2015-2_50Fri, 13 Feb 2015 04:12:54 +0000GATE2005-IT-56
http://gateoverflow.in/3817/gate2005-it-56
<p>Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to a vertex j iff either j = i + 1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is</p>
<ol style="list-style-type: upper-alpha;">
<li>4</li>
<li>7</li>
<li>23</li>
<li>99</li>
</ol>Graph Theoryhttp://gateoverflow.in/3817/gate2005-it-56Mon, 03 Nov 2014 21:36:29 +0000GATE2004-IT-37
http://gateoverflow.in/3680/gate2004-it-37
<p>What is the number of vertices in an undirected connected graph with 27 edges, 6 vertices of degree 2, 3 vertices of degree 4 and remaining of degree 3?</p>
<ol style="list-style-type: upper-alpha;">
<li>10</li>
<li>11</li>
<li>18</li>
<li>19</li>
</ol>Graph Theoryhttp://gateoverflow.in/3680/gate2004-it-37Sun, 02 Nov 2014 04:02:47 +0000GATE2004-IT-5
http://gateoverflow.in/3646/gate2004-it-5
<p>What is the maximum number of edges in an acyclic undirected graph with n vertices?</p>
<ol style="list-style-type: upper-alpha;">
<li>n-1</li>
<li>n</li>
<li>n+1</li>
<li>2n-1</li>
</ol>Graph Theoryhttp://gateoverflow.in/3646/gate2004-it-5Sat, 01 Nov 2014 21:47:00 +0000GATE2006-IT-11
http://gateoverflow.in/3550/gate2006-it-11
<p>If all the edge weights of an undirected graph are positive, then any subset of edges that connects all the vertices and has minimum total weight is a</p>
<ol style="list-style-type: upper-alpha;">
<li>Hamiltonian cycle</li>
<li>grid</li>
<li>hypercube</li>
<li>tree</li>
</ol>Graph Theoryhttp://gateoverflow.in/3550/gate2006-it-11Fri, 31 Oct 2014 01:11:28 +0000GATE2008-IT-27
http://gateoverflow.in/3317/gate2008-it-27
<p>G is a simple undirected graph. Some vertices of G are of odd degree. Add a node v to G and make it adjacent to each odd degree vertex of G. The resultant graph is sure to be</p>
<ol style="list-style-type: upper-alpha;">
<li>regular</li>
<li>complete</li>
<li>Hamiltonian</li>
<li>Euler</li>
</ol>Graph Theoryhttp://gateoverflow.in/3317/gate2008-it-27Tue, 28 Oct 2014 07:36:37 +0000GATE1995_1.25
http://gateoverflow.in/2612/gate1995_1-25
The minimum number of edges in a connected cyclic graph on $n$ vertices is:<br />
<br />
(a) $n-1$<br />
(b) $n$<br />
(c) $n+1$<br />
(d) None of the aboveGraph Theoryhttp://gateoverflow.in/2612/gate1995_1-25Wed, 08 Oct 2014 17:53:31 +0000GATE1993_8.1
http://gateoverflow.in/2299/gate1993_8-1
<p>Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n > 2)$. Then, which of the following statements are true?</p>
<ol style="list-style-type: upper-alpha;">
<li>$G$ has no cycles</li>
<li>The graph obtained by removing any edge from $G$ is not connected</li>
<li>$G$ has at least one cycle</li>
<li>The graph obtained by removing any two edges from $G$ is not connected</li>
<li>None of the above </li>
</ol>
Graph Theoryhttp://gateoverflow.in/2299/gate1993_8-1Mon, 29 Sep 2014 18:45:21 +0000GATE2014-2_3
http://gateoverflow.in/1955/gate2014-2_3
<p><span style="font-family:helvetica neue,helvetica,arial,sans-serif; font-size:14px">The maximum number of edges in a bipartite graph on 12 vertices is____</span></p>
Graph Theoryhttp://gateoverflow.in/1955/gate2014-2_3Sun, 28 Sep 2014 04:49:01 +0000GATE1999_1.15
http://gateoverflow.in/1468/gate1999_1-15
<p>The number of articulation points of the following graph is</p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=6004385987067299973" style="height:156px; width:336px"></p>
<ol style="list-style-type:upper-alpha">
<li>0</li>
<li>1</li>
<li>2</li>
<li>3</li>
</ol>
<p> </p>
Graph Theoryhttp://gateoverflow.in/1468/gate1999_1-15Tue, 23 Sep 2014 17:59:39 +0000