GATE Overflow - Recent questions in Graph Theory
http://gateoverflow.in/questions/mathematics/discrete-mathematics/graph-theory
Powered by Question2Answergraphtheory,Narsingh Deo,4.26
http://gateoverflow.in/130286/graphtheory-narsingh-deo-4-26
Suppose a single tennis tournament is arranged among n players and the number of matches planned is a fixed number e (where n-1 < e < n(n-1)/2 ).For sake of fairness,how will you make sure that some players do not group together and isolate an individual (or a group of players).Graph Theoryhttp://gateoverflow.in/130286/graphtheory-narsingh-deo-4-26Sun, 21 May 2017 03:34:20 +0000#Graphtheory
http://gateoverflow.in/130285/%23graphtheory
Construct a graph G with edge connectivity of G =4 ,vertex connectivity of G =3 and degree of every vertex of G >=5Graph Theoryhttp://gateoverflow.in/130285/%23graphtheorySun, 21 May 2017 02:56:10 +00002 - connected graph
http://gateoverflow.in/130141/2-connected-graph
<p>For a <strong>regular graph</strong> how much large the value of degree (for each vertices) should be such that the graph is $2$ - connected. (vertex wise).</p>
<p>I did in this way :</p>
<p>$\begin{align*} &\quad \kappa(G) \leq \frac{2\cdot e}{n} \qquad \text{ where } \kappa(G) = \text{ vertex connectivity } \\ &\Rightarrow 2 \leq \frac{2\cdot e}{n} \\ &\Rightarrow n \leq e \\ &\Rightarrow n \leq \frac{\sum \left ( d_i \right )}{2} \\ &\Rightarrow n \leq \frac{n \cdot d}{2} \\ &\Rightarrow d \geq 2 \\ \end{align*}$</p>
<p>The above case can be realized by thinking of a <strong>cycle graph</strong> of $n$ vertices.</p>
<p>But in the following case :</p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=15360590681287688332"></p>
<p>This graph is 3 regular and not 2- connected although $d \geq 2$ is satisfied.</p>
<p>Why this $d \geq 2$ is trivial and not working in some cases ?</p>Graph Theoryhttp://gateoverflow.in/130141/2-connected-graphFri, 19 May 2017 07:12:05 +0000Isomorphism and subgraph
http://gateoverflow.in/130078/isomorphism-and-subgraph
If there are two graphs G1 and G2 and both are Isomorphic to each other...Is G1 subset of G2?Graph Theoryhttp://gateoverflow.in/130078/isomorphism-and-subgraphThu, 18 May 2017 15:21:51 +0000find complexity?
http://gateoverflow.in/129573/find-complexity
What is cyclomatic complexity of below program below:<br />
<br />
i=0; n=4;<br />
<br />
while(i<n-1)<br />
<br />
{j=i+1;<br />
<br />
while(j<n)<br />
<br />
{if(A[i]< A[j]) swap (A[i],A[j]);}<br />
<br />
i=i+1;<br />
<br />
}<br />
<br />
A)3 B)4 C)5 D)6Graph Theoryhttp://gateoverflow.in/129573/find-complexitySun, 14 May 2017 04:03:04 +0000GATE Graph Theory
http://gateoverflow.in/129447/gate-graph-theory
Let G = (V, E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected components as G?<br />
<br />
( A ) G1 = (V, E1) where E1 = {(u, v) | (u, v) ∉ E}<br />
( B ) G2 = (V, E2) where E2 = {(u, v) | (v, u) ∉ E}<br />
( C ) G3 = (V, E3) where E3 = {(u, v) | there ish a path of length ≤ 2 from u to v in E}<br />
( D ) G4 = (V4, E) where V4 is the set of vertices in G which are not isolated<br />
<br />
Can anyone give a detailed answer to this question, please? :)Graph Theoryhttp://gateoverflow.in/129447/gate-graph-theoryFri, 12 May 2017 19:24:26 +0000Graph Theory
http://gateoverflow.in/129355/graph-theory
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?Graph Theoryhttp://gateoverflow.in/129355/graph-theoryFri, 12 May 2017 08:04:59 +0000Graph theory
http://gateoverflow.in/129113/graph-theory
Which is the best book for studying GATE CS Graph theory?Graph Theoryhttp://gateoverflow.in/129113/graph-theoryWed, 10 May 2017 04:00:03 +0000Graph theory and Applications Bondy and Murty Exercise Qn 1.9
http://gateoverflow.in/129036/graph-theory-and-applications-bondy-and-murty-exercise-qn-1
<p>A k partite graph is one where vertex set can be partitioned into k subsets so that no edge has both end in any one subset.</p>
<p>A complete k partite graph is one that is simple and in which each vertex is joined to every other vertex that is not in the same subset. The complete m-partite graph on n vertices in which each part has either floor(n/m) or ceil(n/m) vertices is denoted by T<sub>m,n</sub> . Show that</p>
<p>a) | E(T<sub>m,n</sub>) | = $\binom{n-k}{2} + (m-1)\binom{k+1}{2} , k = \left \lfloor n/m \right \rfloor$</p>
<p>b) If G is a complete m-partite graph on n vertices then | E(G) | <= | E(T<sub>m,n</sub>)|, with equality only if G isomorphic to T<sub>m,n</sub></p>Graph Theoryhttp://gateoverflow.in/129036/graph-theory-and-applications-bondy-and-murty-exercise-qn-1Tue, 09 May 2017 16:09:49 +0000keneth r rosen
http://gateoverflow.in/128471/keneth-r-rosen
how to prove that sum of all the vertices in a graph G is equal to twice the number of edges in G.<br />
<br />
please explain step by step .Graph Theoryhttp://gateoverflow.in/128471/keneth-r-rosenSun, 07 May 2017 13:28:40 +0000keneth r rosen
http://gateoverflow.in/128470/keneth-r-rosen
<p>how to prove that graph G with<strong> </strong>e= v - 1 that has no circuit is a tree.</p>Graph Theoryhttp://gateoverflow.in/128470/keneth-r-rosenSun, 07 May 2017 13:26:36 +0000PGEE 2017
http://gateoverflow.in/127521/pgee-2017
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides y<br />
<br />
What would be maximum path length between any two vertices of graph ?Graph Theoryhttp://gateoverflow.in/127521/pgee-2017Sun, 30 Apr 2017 18:04:30 +0000PGEE 2017
http://gateoverflow.in/127520/pgee-2017
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides<br />
<br />
Which vertex will have highest in degree ?Graph Theoryhttp://gateoverflow.in/127520/pgee-2017Sun, 30 Apr 2017 18:00:23 +0000PGEE 2017
http://gateoverflow.in/127519/pgee-2017
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides y<br />
<br />
Find number of strongly connected componentsGraph Theoryhttp://gateoverflow.in/127519/pgee-2017Sun, 30 Apr 2017 17:58:18 +0000Nonisomorphic Graphs
http://gateoverflow.in/127496/nonisomorphic-graphs
How many nonisomorphic connected simple graphs are<br />
there with 5 vertices?Graph Theoryhttp://gateoverflow.in/127496/nonisomorphic-graphsSun, 30 Apr 2017 16:15:23 +0000Paths in a graph
http://gateoverflow.in/127187/paths-in-a-graph
The number of paths of length 5 between two different<br />
vertices in K4 (complete graph)?Graph Theoryhttp://gateoverflow.in/127187/paths-in-a-graphFri, 28 Apr 2017 06:54:07 +0000Rosen discrete mathematics
http://gateoverflow.in/127186/rosen-discrete-mathematics
a)The number of paths of length 4 between any two<br />
adjacent vertices in K3,3 (bipartite graph)?<br />
<br />
b) The number of paths of length 4 between any two<br />
nonadjacent vertices in K3,3 (bipartite graph)?Graph Theoryhttp://gateoverflow.in/127186/rosen-discrete-mathematicsFri, 28 Apr 2017 06:53:43 +0000Self-Doubt
http://gateoverflow.in/126868/self-doubt
Every Planar graph have vertex cover of size atmost 3n/4.<br />
<br />
Can someone provide a good link to understand the above fact?<br />
<br />
Or a good explanation is most welcome.Graph Theoryhttp://gateoverflow.in/126868/self-doubtTue, 25 Apr 2017 06:41:09 +0000graph theory
http://gateoverflow.in/124669/graph-theory
A graph consists of only one vertex,which is isolated ..Is that graph<br />
<br />
A) a complete graph ???<br />
<br />
B) a clique???<br />
<br />
C) connected graph ???<br />
<br />
Please explain your answer ...Graph Theoryhttp://gateoverflow.in/124669/graph-theoryFri, 07 Apr 2017 17:38:26 +0000ISI Entrance Exam MTech (CS)
http://gateoverflow.in/124367/isi-entrance-exam-mtech-cs
Consider all possible trees with n nodes. Let k be the number<br />
of nodes with degree greater than 1 in a given tree. What is<br />
the maximum possible value of k?Graph Theoryhttp://gateoverflow.in/124367/isi-entrance-exam-mtech-csThu, 06 Apr 2017 00:52:41 +0000JNUEE-2016
http://gateoverflow.in/123807/jnuee-2016
Consider an undirected graph G with 100 nodes. What is the maximum number of edges to be included in G so that graph is connected?<br />
<br />
(a) 2451<br />
<br />
(b) 4851<br />
<br />
(c) 4950<br />
<br />
(d) 9990Graph Theoryhttp://gateoverflow.in/123807/jnuee-2016Mon, 03 Apr 2017 21:09:51 +0000cil 2017
http://gateoverflow.in/123566/cil-2017
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=12137641003618320025"></p>
<p>a. 2</p>
<p>b. 4</p>
<p>c. 1</p>
<p>d. 3</p>Graph Theoryhttp://gateoverflow.in/123566/cil-2017Sun, 02 Apr 2017 17:28:21 +0000Graph Theory Path
http://gateoverflow.in/123440/graph-theory-path
What is the difference between path and Euler path?Graph Theoryhttp://gateoverflow.in/123440/graph-theory-pathSun, 02 Apr 2017 02:20:33 +0000Consider a graph of only 1 vertex and no edges. Is it connected or disconnected?
http://gateoverflow.in/122976/consider-graph-only-vertex-and-edges-connected-disconnected
Graph Theoryhttp://gateoverflow.in/122976/consider-graph-only-vertex-and-edges-connected-disconnectedThu, 30 Mar 2017 13:23:42 +0000Suppose a graph G with n vertices is isomorphic to its complement.How many edges does G have?
http://gateoverflow.in/122925/suppose-graph-vertices-isomorphic-complement-many-edges-does
Graph Theoryhttp://gateoverflow.in/122925/suppose-graph-vertices-isomorphic-complement-many-edges-doesWed, 29 Mar 2017 23:01:21 +0000Graph_Theory
http://gateoverflow.in/122276/graph_theory
Determine all non- isomorphic graphs with the number of vertices 20 and edges 188.Graph Theoryhttp://gateoverflow.in/122276/graph_theoryTue, 21 Mar 2017 15:15:08 +0000No of spanning Trees
http://gateoverflow.in/122066/no-of-spanning-trees
Let $K_n$ denote the complete undirected graph with $n$ vertices where n is an even number. Find the maximum number of spanning trees of $K_n$ that can be formed in such a way that no two of these spanning trees have a common edge.Graph Theoryhttp://gateoverflow.in/122066/no-of-spanning-treesSun, 19 Mar 2017 13:10:09 +0000radius ,diameter of graph
http://gateoverflow.in/121818/radius-diameter-of-graph
The distance between two distinct vertices v1 and v2 of a<br />
connected simple graph is the length (number of edges) of<br />
the shortest path between v1 and v2. The radius of a graph<br />
is the minimum over all vertices v of the maximum distance<br />
from v to another vertex. The diameter of a graph<br />
is the maximum distance between two distinct vertices.<br />
Find the radius and diameter of<br />
a) K6. b) K4,5. c) Q3. d) C6.Graph Theoryhttp://gateoverflow.in/121818/radius-diameter-of-graphThu, 16 Mar 2017 16:53:23 +0000Rosen ex.55 chp 8
http://gateoverflow.in/121595/rosen-ex-55-chp-8
If the simple graph G has v vertices and e edges, how many edges does G complement have?Graph Theoryhttp://gateoverflow.in/121595/rosen-ex-55-chp-8Tue, 14 Mar 2017 21:41:53 +0000graph theory
http://gateoverflow.in/121379/graph-theory
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=14124213158983667542"></p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=5624474628795835148"></p>Graph Theoryhttp://gateoverflow.in/121379/graph-theorySun, 12 Mar 2017 17:52:08 +0000graph theory
http://gateoverflow.in/121304/graph-theory
<p><strong>chromatic number of a graph <= ( maxdegree of the graph ) + 1 </strong></p>
<p>can somebody explain how ?</p>Graph Theoryhttp://gateoverflow.in/121304/graph-theorySat, 11 Mar 2017 16:53:30 +0000graph theory
http://gateoverflow.in/121303/graph-theory
A graph with n vertices and 0 edges.can this graph be called as Bipartite ? i mean can we simply partition the n vertices into two sets of vertices such that there is no edge within the set as well there is no edge between the two sets and say it as a Bipartite graph ?Graph Theoryhttp://gateoverflow.in/121303/graph-theorySat, 11 Mar 2017 16:50:02 +0000graph theory
http://gateoverflow.in/121282/graph-theory
State TRUE or FALSE.<br />
<br />
The chromatic number of a Bi-partite graph is ALWAYS 2.Graph Theoryhttp://gateoverflow.in/121282/graph-theorySat, 11 Mar 2017 10:57:10 +0000graph theory
http://gateoverflow.in/121278/graph-theory
The cardinality of the vertex-cut ( seperating set ) of a complete graph with n vertices is ___Graph Theoryhttp://gateoverflow.in/121278/graph-theorySat, 11 Mar 2017 10:16:37 +0000graph theory
http://gateoverflow.in/121240/graph-theory
In a Bipartite graph,the size of the maximum matching is equal to the size of the minimum vertex cover ...can somebody prove this logically ?Graph Theoryhttp://gateoverflow.in/121240/graph-theoryFri, 10 Mar 2017 19:06:22 +0000graph theory
http://gateoverflow.in/121147/graph-theory
<p>The number of <strong>independent sets</strong> in a complete graph with n vertices is ____</p>Graph Theoryhttp://gateoverflow.in/121147/graph-theoryFri, 10 Mar 2017 10:03:49 +0000graph theory
http://gateoverflow.in/121111/graph-theory
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=16494923851889305305"></p>
<p>can somebody explain the logic behind this theorem ?</p>Graph Theoryhttp://gateoverflow.in/121111/graph-theoryThu, 09 Mar 2017 21:25:28 +0000graph theory
http://gateoverflow.in/121050/graph-theory
<p> </p>
<p>Find </p>
<p>1) Vertex connectivity </p>
<p>2) Edge connectivity </p>
<p>3) Is it a seperable graph ? If so then find the cut-vertex </p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=11584695799903342456"></p>Graph Theoryhttp://gateoverflow.in/121050/graph-theoryThu, 09 Mar 2017 10:25:56 +0000graph theory
http://gateoverflow.in/121042/graph-theory
<p> Find </p>
<p>1) Vertex connectivity </p>
<p>2) Edge connectivity </p>
<p>3) Is it a seperable graph ? If so then find the cut-vertex </p>
<p>4) Is {v<sub>1</sub>,v<sub>2</sub>,v<sub>5</sub>} a cut-set ?</p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=38764623861261551"></p>Graph Theoryhttp://gateoverflow.in/121042/graph-theoryThu, 09 Mar 2017 10:10:12 +0000Walk in Graph Theory
http://gateoverflow.in/121022/walk-in-graph-theory
<p>In Narsingh Deo, Walk is defined as "no edge appears (is covered or traversed) in more than 1 walk" but I studied that walk can have repeated edges. Is there a mistake in Narsingh Deo or I am missing some point?</p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=12352650482047581356"></p>Graph Theoryhttp://gateoverflow.in/121022/walk-in-graph-theoryThu, 09 Mar 2017 01:31:59 +0000graph theory
http://gateoverflow.in/120989/graph-theory
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=13344674821615170849"></p>Graph Theoryhttp://gateoverflow.in/120989/graph-theoryWed, 08 Mar 2017 20:35:19 +0000graph theory
http://gateoverflow.in/120988/graph-theory
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=16810418372386685647"></p>Graph Theoryhttp://gateoverflow.in/120988/graph-theoryWed, 08 Mar 2017 20:31:38 +0000graph theory
http://gateoverflow.in/120984/graph-theory
<p> </p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=9619004610669890152"></p>Graph Theoryhttp://gateoverflow.in/120984/graph-theoryWed, 08 Mar 2017 20:22:47 +0000ISI 2015 PCB C3
http://gateoverflow.in/120885/isi-2015-pcb-c3
For a positive integer n, let G = (V, E) be a graph, where V = {0,1}^n, i.e., V is the set of vertices has one to one correspondence with the set of all n-bit binary strings and E = {(u,v) | u, v belongs to V, u and v differ in exactly one bit position}.<br />
<br />
i) Determine size of E<br />
<br />
ii) Show that G is connectedGraph Theoryhttp://gateoverflow.in/120885/isi-2015-pcb-c3Wed, 08 Mar 2017 07:22:42 +0000narsingh deo
http://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 Theoryhttp://gateoverflow.in/119875/narsingh-deoMon, 27 Feb 2017 09:19:57 +0000GATE2017-2-23
http://gateoverflow.in/118594/gate2017-2-23
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .Graph Theoryhttp://gateoverflow.in/118594/gate2017-2-23Tue, 14 Feb 2017 15:35:53 +0000gatebook mock 2
http://gateoverflow.in/117278/gatebook-mock-2
Consider the collection of all un directed graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no self loops and there is at most one edge between any pair of nodes, which of the following is true?<br />
<br />
(A) M = 10, m = 10<br />
<br />
(B) M = 10, m = 1<br />
<br />
(C) M = 7, m = 4<br />
<br />
(D) M = 6, m = 4<br />
<br />
<br />
<br />
Shouldn't the answer be D?Graph Theoryhttp://gateoverflow.in/117278/gatebook-mock-2Wed, 08 Feb 2017 12:35:02 +0000Virtual Test Series
http://gateoverflow.in/116988/virtual-test-series
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=846771792498572003"></p>Graph Theoryhttp://gateoverflow.in/116988/virtual-test-seriesTue, 07 Feb 2017 17:45:16 +0000Bipartite Graph
http://gateoverflow.in/116936/bipartite-graph
If G is a bipartite planar graph with n vertices, then what is the maximum number of egdes in G.<br />
<br />
a) 2n-4<br />
<br />
b) 3n-2<br />
<br />
c) n-2<br />
<br />
d) nGraph Theoryhttp://gateoverflow.in/116936/bipartite-graphTue, 07 Feb 2017 16:19:53 +0000Graph Theory (Chromatic no)
http://gateoverflow.in/116685/graph-theory-chromatic-no
<p><img alt="" height="116" src="http://gateoverflow.in/?qa=blob&qa_blobid=12318005620946289803" width="679"></p>Graph Theoryhttp://gateoverflow.in/116685/graph-theory-chromatic-noTue, 07 Feb 2017 02:32:55 +0000