Register
Webpage for Graph Theory:

Recent questions tagged graph-theory

1 votes
1 answer
575
IIT Kanpur written
If a graph has k-independent components, it it n-k+1 colorable
If a graph has k-independent components, it it n-k+1 colorable
User Avatar
44 votes
9 answers
576
GATE CSE 2017 Set 2 | Question: 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 _________ .
$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 _________ .
User Avatar
0 votes
0 answers
578
GRAPH TRAVERSALS
WHY CROSS EDGES TURN TO BE BACK EDGES IN UNDIRECTED GRAPH IN DFS TRAVERSAL?? CAN ANYONE EXPLAIN THIS. WHY ARE THERE NO CROSS EDGES IN DFS OF UNDIRECTED GRAPH??
WHY CROSS EDGES TURN TO BE BACK EDGES IN UNDIRECTED GRAPH IN DFS TRAVERSAL?? CAN ANYONE EXPLAIN THIS. WHY ARE THERE NO CROSS EDGES IN DFS OF UNDIRECTED GRAPH??
User Avatar
0 votes
1 answer
579
graph theory , clique and isolated graph
here in this question they have asked about the number of edges but i cant find a way to solve pls help here...
here in this question they have asked about the number of edges but i cant find a way to solve pls help here...
User Avatar
4 votes
2 answers
580
Euler Path
Which of the following Graph has Euler Path but is not an Euler Graph? A. K1,1 B.K2,10 C.K2,11 D.K10,11.
Which of the following Graph has Euler Path but is not an Euler Graph?A. K1,1 B.K2,10 C.K2,11D.K10,11.
User Avatar
0 votes
1 answer
581
graph theory
How many distinct paths of length 4 that do not visit the same node more than once are there between node 0 and node 1?
How many distinct paths of length 4 that do not visit the same node more than once are there between node 0 and node 1?
User Avatar
0 votes
1 answer
582
VirtualGate Test Series: Discrete Mathematics - Graph Theory
$G$ be a simple graph on $8$ vertices such that there is a vertices of degrees $1,2,3,4,5,6,7$ respectively, Then which of the following can be the degree of the last vertex$?$ $3$ $0$ $5$ $4$
$G$ be a simple graph on $8$ vertices such that there is a vertices of degrees $1,2,3,4,5,6,7$ respectively, Then which of the following can be the degree of the last ver...
User Avatar
1 votes
1 answer
587
Testbook
I am not getting how statement 3 is false and statement 4 is true. Statement 3: If the weights are unique, ho can there be multiple second best spanning trees? Statement 4: If the graph is triangle, wont there be any spanning tree?
I am not getting how statement 3 is false and statement 4 is true.Statement 3: If the weights are unique, ho can there be multiple second best spanning trees?Statement 4:...
User Avatar
0 votes
1 answer
588
Graph Theory Problem-Test Series
A Connected Graph has Cut edge, Then Graph has Cut vertex also. 1. True 2. False Choose Correct One.
A Connected Graph has Cut edge, Then Graph has Cut vertex also.1. True2. FalseChoose Correct One.
User Avatar
1 votes
0 answers
590
Disconnected components
User Avatar
0 votes
1 answer
591
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 (A) 22 (B) 23 (C) 24 (D) 25 P.S. Explain with ease, if possible!
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(A) 22(B) 23(C) 24(D) 25P.S. Explain wit...
User Avatar
0 votes
1 answer
592
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 ? Any video lectures or anything please help :)
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 ...
User Avatar
0 votes
0 answers
599
Testbook
The relation between size of a maximum matching in a disconnected graph G on vertex set V and the size of a maximum matching of a connected graph G on same vertex set V is (A) < (B) (C) (D) None of the above.
The relation between size of a maximum matching in a disconnected graph G on vertex set V and the size of a maximum matching of a connected graph G on same vertex set V...
User Avatar
Page: