Recent questions tagged graph-theory

2 votes
0 answers
61
The maximum number of edges possible in a graph G with 9 vertices which is 3 colourable is equal toA 24B 27C 36D None of the above
0 votes
0 answers
67
What is a biconnected componenet?Does it always include V-V’ where V’ represent the set of articulation points of a graph G?
1 votes
0 answers
69
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?
0 votes
0 answers
70
Let Gn be the complete bipartite graph K13, 17 then the chromatic number of G̅n is _____ (G̅n is complement of Gn and n = 30)A13B17Cn(n−1)2−13×17Dn(n−1)2−2
0 votes
0 answers
71
If [P(A); ⊆] is a lattice where A = {x, y} and P(A) is the power set then what is the sum of element in Greatest Lower Bound (GLB) set of given lattice?x + y xy0
3 votes
0 answers
73
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?
3 votes
0 answers
75
1 votes
0 answers
76
Given a tree $\text{T}$ and $\lambda \geq 2$ colours $\left(c_{1}, c_{2}, \ldots, c_{\lambda}\right),$ how many proper colourings of the tree $\text{T}$ are possible?
1 votes
0 answers
77
1 votes
0 answers
78
0 votes
1 answer
79