20 questions
The graph representing universal relation is called
Complete graph
Partial digraph
Empty graph
Partial subgraph
A simple graph can have
Multiple edges
Self loops
Parallel edges
No Multiple ,Self, Parallel edges
Degree of graph with 12 vertices is
25
56
24
212
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
7
43
13
10
The relation
is a partial order if it isReflexive
Anti symmetric
Transitive
Reflexive, Anti symmetric , Transitive
In which of the following relations every pair of elements is comparable
Let G be graph defined as the Hass diagram for the
relation on the set S {1,2,.........18} . How may edges are there in G?43722
2359296
6487535
131963
In a star graph the degree of each and every vertex is
same
equal
not equal
none of the above
Bipartite graph are used in
Modern coding theory
coloring graph
neural networks
chemical bonds
The spectrum of a graph is .......if and only if it is ...........graph
symmetry,bipartite
transitive , bipartite
cyclic,euler
reflexive,planar
Every complete bipartite graph must not be
Planer graph
line graph
complete graph
sub graph
In a ..........the vertex set and the edge set are finite sets
finite graph
bipartite graph
infinite graph
connected graph
The number of edges in a regular graph of degree 46 and 8 vertex is
347
230
184
186
A bridge can not be a part of
A simple cycle
connected graph
a tree
closed path
The minimum number of edges in a connected cyclic graph on n vertices is
n -1
n
2n+3
n+1
A ......... is a graph with no homomorphism to any proper sub graph
poset
core
walk
trail
Every isomorphic graph must have ................. representation
cyclic
adjacency list
tree
adjacency matrix
In modern particle physics there must exist
Group theory
Graph theory
lattice
invariant semi group
For any graph say G, Cayley graph is
canonical
non canonical
isomorphic
homomorphism
The ............... of a graph G consists of all vertices and edge of G
edge graph
line graph
path
eulerian circuit