Ask
Login
TAGGED IN

Discrete Mathematics

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

ALL TAGS
0
votes
1
answer
2.0k
views
1
answer
Find the ordinary generating functions for the given sequences: (i) {2,2,2,2 ----} (ii) {1,1,1,1---}
discrete mathematics updated 2.9 years ago by pedsangini276 • 4.8k
0
votes
1
answer
8.5k
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.9 years ago by pedsangini276 • 4.8k
0
votes
1
answer
839
views
1
answer
Show that the following graphs are isometric
discrete mathematics updated 2.9 years ago by pedsangini276 • 4.8k
0
votes
1
answer
1.2k
views
1
answer
Determine the Eulerian and Hamiltonian path, if exists, in the following graphs:
discrete mathematics updated 2.9 years ago by pedsangini276 • 4.8k
0
votes
1
answer
1.6k
views
1
answer
Determine if following graphs g and G' are isomorphic or not.
discrete mathematics updated 2.9 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.9 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.9 years ago by pedsangini276 • 4.8k
1
vote
1
answer
2.8k
views
1
answer
Define Hamiltonian path and Hamiltonian circuit, determine whether the given graph has Hamiltonian path and Hamiltonian circuit.
discrete mathematics updated 2.9 years ago by pedsangini276 • 4.8k
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.9 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.9 years ago by pedsangini276 • 4.8k
0
votes
1
answer
10k
views
1
answer
What is the total number of vertices in a full binary tree with 20 leaves?
discrete mathematics updated 2.9 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.9 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.9 years ago by pedsangini276 • 4.8k
0
votes
1
answer
1.1k
views
1
answer
prove that by mathematical induction
discrete mathematics updated 2.9 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.9 years ago by pedsangini276 • 4.8k
0
votes
1
answer
20k
views
1
answer
How many symmetric and reflexive relations are there on a set with n elements?
discrete mathematics updated 2.9 years ago by sagarkolekar ★ 11k
<prev • 116 results • page 5 of 5 • next >