Scribd
Upload
8 views3 pages

DSGT Answers

Important questions in dsgt

Uploaded by

vaibhavpednekar267
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views3 pages

DSGT Answers

Important questions in dsgt

Uploaded by

vaibhavpednekar267
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

1•Partition set

A partition set is a collection of non-


empty subsets of a set, where every
element in the original set belongs to
exactly one subsets

2•Euler’s path and circuit 3• Hamilton path and circuit 3• Adjacency Matrix

The adjacency matrix can also be known as


the connection matrix. It is a matrix that
contains rows and columns which are used
to represent a simple labeled graph, with the
two numbers 0 or 1 in the position of (Vi, Vj)
according to the condition whether the two Vi
and Vj are adjacent or not.

4•Cartesian product
The Cartesian Product of sets A and B is
defined as the set of all ordered pairs (x, y)
such that x belongs to A and y belongs to B.
For example, if A = {1, 2} and B = {3, 4, 5}, then
the Cartesian Product of A and B is {(1, 3), (1,
4), (1, 5), (2, 3), (2, 4), (2, 5)}.

5• Bipartite Graph 8•Bijective function 10• Commutative ring


Bipartite graph is a graph in which the vertex If a function f: A → B satisfies both the A ring R that satisfies the additional axiom
set, V, can be partitioned into two subsets, X injective (one-to-one function) and surjective that ab = ba for all a, b ∈ R.Examples are Z, R,
and Y, such that each edge of the graph has function (onto function) propertiesIt means Zn, 2Z, but not Mn® if n ≥ 2. Definition. A ring
one vertex in X and one vertex in Y. that every element “b” in the codomain B, with identity is a ring R that contains a
there is exactly one element “a” in the multiplicative identity element 1R: 1Ra = a =
domain A. such that f(a) = b. a1R for all a ∈ R.
6• Eulerian Graph
A graph with an Eulerian circuit, a closed
walk that visits each edge exactly once and 9• Incidence Matrix
returns to the starting vertex The incidence matrix A of an undirected
graph has a row for each vertex and a column
for each edge of the graph The element A[[I,j]]
7• Quantifier
of A is 1 if the ith vertex is a vertex of the jth
Words that refer to quantities such as ”some” edge and 0 otherwise. The incidence matrix A
or ”all” and tell for how many elements a of a directed graph has a row for each vertex
given predicate is true and a column for each edge of the graph.

You might also like