Register

graph theory

• recategorized by
1,402 views
0 0 votes
10.A graph G has any two vertices connected by exactly one path. Find the
Number of ways we can properly colour G it we are provided with 10
colours.

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Number of relationNext → · IITG-spot round
← Previous in category · UGC NET CSE | July 2...Next in category → · Testbook Test Series...
Position:
Show:

Related questions

9 9 votes
1 1 answer
740
740 views
GO Classes asked May 27
740 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Does there exist a simple Eulerian graph on 6 vertices and 7 edges.Enter $1$ for Yes and $0$ for No.
3 3 votes
2 2 answers
421
421 views
GO Classes asked May 27
421 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Does the following graph have a Hamiltonian cycle? Enter $1$ for Yes and $0$ for No.  
3 3 votes
1 1 answer
437
437 views
GO Classes asked May 27
437 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Is the following graph Hamiltonian? Enter $1$ for Yes and $0$ for No.
4 4 votes
4 4 answers
464
464 views
GO Classes asked May 27
464 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Does there exist a graph with the following degree sequence:$$3,3,3,3,5,6,6,6,6,6,6$$Enter $1$ Yes and $0$ for No