The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the given graph (as shown in GATE 2024 CS2 Q60) is _________

Consider a complete graph K_n with n vertices (n > 4). Note that multiple spanning trees can be cons…

Let G be an undirected graph which is a path on 8 vertices. The number of matchings in G is ______.

The number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is _________

The chromatic number of a graph is the minimum number of colours used in a proper colouring of the g…

Let A be the adjacency matrix of a simple undirected graph G. Suppose A is its own inverse. Which on…

Let G be a simple finite undirected graph with vertex set {v1,...,vn}. Let Delta(G) be the maximum d…