Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Graph Theory:
Recent questions tagged graph-theory
2
votes
2
answers
421
Subgraph
Number of subgraphs possible for K3 =____________
Number of subgraphs possible for K3 =____________
srestha
1.3k
views
srestha
asked
Jan 9, 2018
Graph Theory
graph-theory
+
–
2
votes
1
answer
422
gate forum test series
How to solve this question?
How to solve this question?
charul
263
views
charul
asked
Jan 8, 2018
Graph Theory
graph-theory
discrete-mathematics
+
–
2
votes
1
answer
423
Ace Test series: Graph Theory - Graph Connectivity
Please can anyone tell whether my answer is wrong or solution provided by them is correct??
Please can anyone tell whether my answer is wrong or solution provided by them is correct??
Asim Abbas
471
views
Asim Abbas
asked
Jan 8, 2018
Graph Theory
ace-test-series
graph-theory
graph-connectivity
+
–
4
votes
1
answer
424
graph theory
Lakshman Bhaiya
682
views
Lakshman Bhaiya
asked
Jan 6, 2018
Graph Theory
discrete-mathematics
graph-theory
+
–
2
votes
1
answer
425
gate forum test series
2 vertices connected by an edge is a complete graph (G) and for complete graph (Kn) vertex connectivity is (n-1), so for this G connectivity is 1, now will it be considered as a biconnected component of the given graph or not, if yes then why?
2 vertices connected by an edge is a complete graph (G) and for complete graph (Kn) vertex connectivity is (n-1), so for this G connectivity is 1, now will it be consider...
charul
444
views
charul
asked
Jan 6, 2018
Graph Theory
graph-theory
+
–
1
votes
0
answers
426
Ace Test series: Programming & DS - Graphs
Kuldeep Pal
218
views
Kuldeep Pal
asked
Jan 6, 2018
Programming in C
ace-test-series
data-structures
graph-theory
+
–
1
votes
0
answers
427
bfs on bipartite graph
The maximum possible height of BFS tree, if BSF is run on a complete bipartite graph km,n, where m ≥ 1, n ≥ 1 with starting vertex ‘S’ is how bfs works on bipartite graph ??? is it coreect way?? how binary tree is drawn from bfs?
The maximum possible height of BFS tree, if BSF is run on a complete bipartite graph km,n, where m ≥ 1, n ≥ 1 with starting vertex ‘S’ is how bfs works on biparti...
Jaspreet Kaur Bains
848
views
Jaspreet Kaur Bains
asked
Jan 3, 2018
Programming in C
graph-theory
+
–
0
votes
0
answers
428
graph theory
how "Every planar graph whose faces all have even length is bipartite" plz give example "i found this on wikipedia"
how "Every planar graph whose faces all have even length is bipartite"plz give example"i found this on wikipedia"
Ravi prakash pandey
202
views
Ravi prakash pandey
asked
Jan 2, 2018
Algorithms
graph-theory
discrete-mathematics
+
–
1
votes
2
answers
429
Graph theory
Pawan Kumar 2
703
views
Pawan Kumar 2
asked
Dec 31, 2017
Graph Theory
graph-theory
+
–
2
votes
1
answer
430
GRAPH THEORY
A graph G=(V,E)satisfies |E|≤3|v|-6, the min degree of G is defined asmin{degree(v) } v∈V. Therefore min degree of ‘G’ can be? A. 11 B. 4 C. 6 D. 5
A graph G=(V,E)satisfies |E|≤3|v|-6, the min degree of G is defined asmin{degree(v) } v∈V. Therefore min degree of ‘G’ can be?A. 11B. 4C. 6D. 5
sunil sarode
538
views
sunil sarode
asked
Dec 30, 2017
Graph Theory
graph-theory
discrete-mathematics
+
–
2
votes
0
answers
431
Gateforum test series
answer given is option A.
answer given is option A.
charul
284
views
charul
asked
Dec 29, 2017
Graph Theory
gateforum-test-series
graph-theory
+
–
3
votes
0
answers
432
Hamiltonian cycle
How many number of Hamiltonian cycles possible for a complete graph in all the case (i.e. ordered, unordered, edge-disjoint ...)??
How many number of Hamiltonian cycles possible for a complete graph in all the case (i.e. ordered, unordered, edge-disjoint ...)??
thepeeyoosh
442
views
thepeeyoosh
asked
Dec 29, 2017
Graph Theory
graph-theory
graph-connectivity
+
–
0
votes
1
answer
433
Graph
Suppose G is a connected planar simple graph having V vertices, E edges . Let R denote number of bounded regions, in a planar representation of G. Which of the following correct representation of E, V, R? 1) E-V+R=1 2) V-E+R=1 3) E-V+R=2 4) V-E+R=2
Suppose G is a connected planar simple graph having V vertices, E edges . Let R denote number of bounded regions, in a planar representation of G. Which of the following ...
srestha
683
views
srestha
asked
Dec 28, 2017
Graph Theory
graph-theory
discrete-mathematics
+
–
0
votes
2
answers
434
MadeEasy Test Series: Graph Theory
How to solve such problems?
How to solve such problems?
Kalpataru Bose
573
views
Kalpataru Bose
asked
Dec 26, 2017
Graph Theory
made-easy-test-series
discrete-mathematics
graph-theory
+
–
1
votes
1
answer
435
Ace Test Series: Graph Theory - Counting
Number of multi-graphs possible with 4 vertices and at most 2 edges between each pair of vertices is ________________
Number of multi-graphs possible with 4 vertices and at most 2 edges between each pair of vertices is ________________
Satyam Rohela
930
views
Satyam Rohela
asked
Dec 25, 2017
Graph Theory
ace-test-series
graph-theory
counting
+
–
0
votes
0
answers
436
Graph Theory Doubt
Let G be a planar graph with 7 vertices, 10 edges and 3 components then the number of regions are : a)24 b)37 c)7 d)10 Answer given : 7 How to solve this ? Is there any formulae for number of regions calculation? The only one I know is r=e-n+2 for any planar graph.
Let G be a planar graph with 7 vertices, 10 edges and 3 components then the number of regions are :a)24b)37c)7d)10Answer given : 7How to solve this ? Is there any formula...
Sourajit25
581
views
Sourajit25
asked
Dec 25, 2017
Graph Theory
graph-theory
discrete-mathematics
engineering-mathematics
graph-connectivity
+
–
1
votes
0
answers
437
graph theory
Pawan Kumar 2
324
views
Pawan Kumar 2
asked
Dec 24, 2017
Graph Theory
graph-theory
+
–
0
votes
0
answers
438
Graph_theory
Doubt in 2nd and 3rd ....
Doubt in 2nd and 3rd ....
Pawan Kumar 2
357
views
Pawan Kumar 2
asked
Dec 24, 2017
Graph Theory
graph-theory
+
–
0
votes
0
answers
439
Test Series
Consider the following graph: Which of the following will represents the chromatic number of the graph? I think ans has to be 3 but given as 4
Consider the following graph:Which of the following will represents the chromatic number of the graph?I think ans has to be 3 but given as 4
akb1115
382
views
akb1115
asked
Dec 24, 2017
Graph Theory
graph-theory
graph-coloring
+
–
1
votes
0
answers
440
#GRAPH THEORY
Abhijeet_Kumar
615
views
Abhijeet_Kumar
asked
Dec 23, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-coloring
+
–
2
votes
2
answers
441
graph theory
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
Parshu gate
800
views
Parshu gate
asked
Dec 23, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
+
–
0
votes
1
answer
442
#graph theory
Abhijeet_Kumar
603
views
Abhijeet_Kumar
asked
Dec 22, 2017
Graph Theory
graph-theory
discrete-mathematics
+
–
1
votes
1
answer
443
#graph theory
Abhijeet_Kumar
299
views
Abhijeet_Kumar
asked
Dec 22, 2017
Graph Theory
graph-theory
discrete-mathematics
+
–
5
votes
2
answers
444
#graph theory
Abhijeet_Kumar
738
views
Abhijeet_Kumar
asked
Dec 22, 2017
Graph Theory
graph-theory
discrete-mathematics
+
–
0
votes
0
answers
445
Trail
The edge set of every closed trail can be partitioned into edge sets of cycles True / False (Explain)
The edge set of every closed trail can be partitioned into edge sets of cyclesTrue / False (Explain)
yogi_p
795
views
yogi_p
asked
Dec 21, 2017
Graph Theory
graph-theory
+
–
0
votes
1
answer
446
Matching number in complete bipartitite graph
I am not convinced by this. Please explain or please tell me the source from where I can clear this out.
I am not convinced by this. Please explain or please tell me the source from where I can clear this out.
atul_21
511
views
atul_21
asked
Dec 21, 2017
Graph Theory
discrete-mathematics
graph-theory
graph-matching
+
–
0
votes
0
answers
447
PERFECT MATCHING
Consider complete graphs K5 and K6 . Let X5 and X6 are number of perfect matching of K5 and K6 respectively. Then X5 + X6 = ________.
Consider complete graphs K5 and K6 . Let X5 and X6 are number of perfect matching of K5 and K6 respectively. Then X5 + X6 = ________.
Jaspreet Kaur Bains
1.7k
views
Jaspreet Kaur Bains
asked
Dec 19, 2017
Graph Theory
discrete-mathematics
graph-theory
graph-matching
+
–
1
votes
1
answer
448
graph Theory
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i,j):1<=i<=12,1<=j<=12}. There is an edge between (a, b) and (c, d) if |a-c|<=1 and |b-d|<=1. The number of edges in this graph is __________.
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i,j):1<=i<=12,1<=j<=12}. There is an edge between (a, b) and (c, d) if |a-c|<=1 ...
Parshu gate
422
views
Parshu gate
asked
Dec 10, 2017
Graph Theory
discrete-mathematics
graph-theory
+
–
3
votes
1
answer
449
Graph - no of regions
Consider 11-regular connected graph of order 8. How many regions are there in planar embedding?
Consider 11-regular connected graph of order 8. How many regions are there in planar embedding?
Tuhin Dutta
1.8k
views
Tuhin Dutta
asked
Dec 10, 2017
Graph Theory
graph-theory
+
–
30
votes
6
answers
450
TIFR CSE 2018 | Part A | Question: 9
How many ways are there to assign colours from range $\left\{1,2,\ldots,r\right\}$ to vertices of the following graph so that adjacent vertices receive distinct colours? $r^{4}$ $r^{4} - 4r^{3}$ $r^{4}-5r^{3}+8r^{2}-4r$ $r^{4}-4r^{3}+9r^{2}-3r$ $r^{4}-5r^{3}+10r^{2}-15r$
How many ways are there to assign colours from range $\left\{1,2,\ldots,r\right\}$ to vertices of the following graph so that adjacent vertices receive distinct colours?...
Rohit Gupta 8
4.5k
views
Rohit Gupta 8
asked
Dec 10, 2017
Graph Theory
tifr2018
graph-theory
graph-coloring
+
–
Page:
« prev
1
...
10
11
12
13
14
15
16
17
18
19
20
...
30
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register