Skip to Content

Build your own quiz

20 questions

Show Answers

See Preview

- Multiple ChoicePlease save your changes before editing any questions.
The graph representing universal relation is called

Complete graph

Partial digraph

Empty graph

Partial subgraph

- Multiple ChoicePlease save your changes before editing any questions.
A simple graph can have

Multiple edges

Self loops

Parallel edges

No Multiple ,Self, Parallel edges

- Multiple ChoicePlease save your changes before editing any questions.
Degree of graph with 12 vertices is

25

56

24

212

- Multiple ChoicePlease save your changes before editing any questions.
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

- Multiple ChoicePlease save your changes before editing any questions.
The relation

$\le$ is a partial order if it isReflexive

Anti symmetric

Transitive

Reflexive, Anti symmetric , Transitive

- Multiple ChoicePlease save your changes before editing any questions.
In which of the following relations every pair of elements is comparable

$\le$

$\ge$

$\subseteq$

$\supseteq$

- Multiple ChoicePlease save your changes before editing any questions.
Let G be graph defined as the Hass diagram for the

$\subseteq$ relation on the set S {1,2,.........18} . How may edges are there in G?43722

2359296

6487535

131963

- Multiple ChoicePlease save your changes before editing any questions.
In a star graph the degree of each and every vertex is

same

equal

not equal

none of the above

- Multiple ChoicePlease save your changes before editing any questions.
Bipartite graph are used in

Modern coding theory

coloring graph

neural networks

chemical bonds

- Multiple ChoicePlease save your changes before editing any questions.
The spectrum of a graph is .......if and only if it is ...........graph

symmetry,bipartite

transitive , bipartite

cyclic,euler

reflexive,planar

- Multiple ChoicePlease save your changes before editing any questions.
Every complete bipartite graph must not be

Planer graph

line graph

complete graph

sub graph

- Multiple ChoicePlease save your changes before editing any questions.
In a ..........the vertex set and the edge set are finite sets

finite graph

bipartite graph

infinite graph

connected graph

- Multiple ChoicePlease save your changes before editing any questions.
The number of edges in a regular graph of degree 46 and 8 vertex is

347

230

184

186

- Multiple ChoicePlease save your changes before editing any questions.
A bridge can not be a part of

A simple cycle

connected graph

a tree

closed path

- Multiple ChoicePlease save your changes before editing any questions.
The minimum number of edges in a connected cyclic graph on n vertices is

n -1

n

2n+3

n+1

- Multiple ChoicePlease save your changes before editing any questions.
A ......... is a graph with no homomorphism to any proper sub graph

poset

core

walk

trail

- Multiple ChoicePlease save your changes before editing any questions.
Every isomorphic graph must have ................. representation

cyclic

adjacency list

tree

adjacency matrix

- Multiple ChoicePlease save your changes before editing any questions.
In modern particle physics there must exist

Group theory

Graph theory

lattice

invariant semi group

- Multiple ChoicePlease save your changes before editing any questions.
For any graph say G, Cayley graph is

canonical

non canonical

isomorphic

homomorphism

- Multiple ChoicePlease save your changes before editing any questions.
The ............... of a graph G consists of all vertices and edge of G

edge graph

line graph

path

eulerian circuit