Ask
Login
TAGGED IN

Discrete Mathematics

Follow this tag to get notifications whenever a new post is added

ALL TAGS
3
votes
1
answer
33k
views
1
answer
Let A={1, 2, 3, 4} and R={(1, 2), (2, 3), (3, 4), (2, 1)}. Find the transitive closure using Warshall's algorithm.
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
3
votes
1
answer
2.7k
views
1
answer
Discrete Structures: Equivalence Relation
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
2
votes
1
answer
23k
views
1
answer
Consider the group G = (1,2,3,4,5,6) under multiplication modulo 7 a) Find multiplication table of G b) find Inverse of every element
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
1.1k
views
1
answer
Determine the Eulerian and Hamiltonian path, if exists, in the following graphs:
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
3.8k
views
1
answer
Define isometric graphs. Show that following graphs are isomorphic.
discrete mathematics updated 2.8 years ago by sagarkolekar ★ 11k
1
vote
1
answer
21k
views
1
answer
How many vertices are necessary to construct a graph with exactly 6 edges in which each vertex is of degree 2.
discrete mathematics updated 2.8 years ago by sagarkolekar ★ 11k
0
votes
1
answer
1.8k
views
1
answer
Let the function f, g and h defined as follows: $f: R- > R, f(x)=2x+3\\ g:R- > R, g(x)=3x+4\\ h:R- > R, h(x)=4x \\ \text{Find gof, fog, foh, hof, gofoh}$
discrete mathematics updated 2.8 years ago by sagarkolekar ★ 11k
0
votes
1
answer
984
views
1
answer
Find the generating function for the following series
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
3
votes
1
answer
22k
views
1
answer
Find the generating function for the following sequence 1,2,3,4,5,6.........
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
1.2k
views
1
answer
Find the generating function for the following sequence
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
3.9k
views
1
answer
Find the solution to the recurrence relation $a_n=6a_{n-1}+11a_{n-2}-6a_{n-3}$ given $a_0=20,a_1=5 \ \ and \ \ a_2=15$
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
8.4k
views
1
answer
Solve the following recurrence relation: $a_n-7a_{n-1}+10a_{n-2}= 0$ with initial condition $a_0= 1, a_1= 6$.
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
832
views
1
answer
Show that the following graphs are isometric
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
1.8k
views
1
answer
Question based on pigeonhole principle
discrete mathematics updated 2.8 years ago by Krishna_Agrawal • 2.7k
0
votes
1
answer
1.6k
views
1
answer
Determine if following graphs g and G' are isomorphic or not.
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
1.5k
views
1
answer
Determine Euler Cycle and path in graph shown below
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
2.0k
views
1
answer
If f:A->B and if g:B->C are both one-one and onto, then $(g o f)^{-1} =f^{-1} o g ^{-1}$
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
2
votes
1
answer
49k
views
1
answer
R be a relation on set of integers Z defined by R = {(x, y) | x-y is divisible by 3} Show that R is an equivalence relation and describe the equivalence classes.
discrete mathematics updated 2.1 years ago by sagarkolekar ★ 11k
0
votes
1
answer
1.2k
views
1
answer
Define Eular path and Eular circuit, determine whether the given graph has Eular path and Eular circuit.
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
3.6k
views
1
answer
Define isomorphic graphs. Show that the following two graphs are isomorphic.
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
10.0k
views
1
answer
What is the total number of vertices in a full binary tree with 20 leaves?
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
3.1k
views
1
answer
Let G be the set of rational numbers other than 1.
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
1
vote
1
answer
19k
views
1
answer
Show that if every element in a group is its own inverse, then the group must be abelian.
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
1.1k
views
1
answer
prove that by mathematical induction
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
4.9k
views
1
answer
How many vertices are necessary to construct a graph with exactly 6 edges in which each vertex is of degree 2.
discrete mathematics updated 2.8 years ago by pedsangini276 • 4.8k
<prev • 116 results • page 1 of 5 • next >