October 15, 2023

UGC NET CS 2016 July- paper-2

Question 5 A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are […]
October 16, 2023

PUERTA 2008-IT

Pregunta 3 ¿Cuál es el número cromático de la siguiente gráfica? A 2 B 3 C 4 D 5 Ingeniería-MatemáticasTeoría de grafos Question 3 Explanation:  Chromatic […]
October 16, 2023

UGC NET CS 2015 Jun- paper-2

Question 5 Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? […]
error: Alert: Content selection is disabled!!