G is an undirected graph with n vertices and 26 edges such that each vertex of G has a degree at least 4. then the maximum possible value of n is

In which of the following relations every pair of elements is comparable

Let G be graph defined as the Hass diagram for the

In a star graph the degree of each and every vertex is

Bipartite graph are used in

The spectrum of a graph is .......if and only if it is ...........graph

Every complete bipartite graph must not be

In a ..........the vertex set and the edge set are finite sets

The number of edges in a regular graph of degree 46 and 8 vertex is

A bridge can not be a part of

The minimum number of edges in a connected cyclic graph on n vertices is

A ......... is a graph with no homomorphism to any proper sub graph

Every isomorphic graph must have ................. representation

In modern particle physics there must exist

For any graph say G, Cayley graph is

The ............... of a graph G consists of all vertices and edge of G