Recent questions tagged graph-theory

2 votes
2 answers
421
Number of subgraphs possible for K3 =____________
2 votes
1 answer
422
2 votes
1 answer
423
4 votes
1 answer
424
2 votes
1 answer
425
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...
1 votes
0 answers
427
0 votes
0 answers
428
how "Every planar graph whose faces all have even length is bipartite"plz give example"i found this on wikipedia"
1 votes
2 answers
429
2 votes
1 answer
430
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
2 votes
0 answers
431
3 votes
0 answers
432
How many number of Hamiltonian cycles possible for a complete graph in all the case (i.e. ordered, unordered, edge-disjoint ...)??
0 votes
1 answer
433
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 ...
1 votes
1 answer
435
Number of multi-graphs possible with 4 vertices and at most 2 edges between each pair of vertices is ________________
1 votes
0 answers
437
0 votes
0 answers
438
Doubt in 2nd and 3rd ....
0 votes
0 answers
439
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
2 votes
2 answers
441
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
0 votes
1 answer
442
1 votes
1 answer
443
5 votes
2 answers
444
0 votes
0 answers
445
The edge set of every closed trail can be partitioned into edge sets of cyclesTrue / False (Explain)
0 votes
1 answer
446
0 votes
0 answers
447
Consider complete graphs K5 and K6 . Let X5 and X6 are number of perfect matching of K5 and K6 respectively. Then X5 + X6 = ________.
1 votes
1 answer
448
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 ...
3 votes
1 answer
449
Consider 11-regular connected graph of order 8. How many regions are there in planar embedding?