Register
Filter

Recent questions in Discrete Mathematics

0 votes
0 answers
104
#self_doubt#pyq#graphtheory
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to the answer is 45 but for the following cases, what will be the answer? 1- if the graph is directed 2- if vertices are not labeled.
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal tothe answer is 45 but for ...
User Avatar
0 votes
0 answers
105
made easy test series
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 12 edges and 9 nodes. Then how many columns of A are independent? what this question want to ask can someone help me {hint}
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 12 edges and 9 nodes. Then how many columns of A are independent?what this question want...
User Avatar
0 votes
1 answer
106
Zeal DM test-5
Is the simplification that I have encircled, done right? because according to negation law (r ∨ ¬ r) ≡ T.
Is the simplification that I have encircled, done right? because according to negation law (r ∨ ¬ r) ≡ T.
User Avatar
0 votes
1 answer
107
#applied course
how many regions are in the above graph and please explain with region formula also. r=e-v+(c+1) my attempt is : r=5-5+2 r=2 but the rule is twice the no of boundary edges which is (5*2) = sum of region degrees which (4+5=9 ) can someone explain where the fault is
how many regions are in the above graph and please explain with region formula also.r=e-v+(c+1)my attempt is :r=5-5+2r=2but the rule is twice the no of boundary edges whi...
User Avatar
0 votes
1 answer
108
#TestBook #TestSeries
((f,g)|f(0)=g(0) or f(1)=g(1)) is the relation equivalent on set of function for all Z to Z . I find this to be equivalence relation ,but the solution says its not .cannot understand the solution properly . Anyone please Clear my doubt
((f,g)|f(0)=g(0) or f(1)=g(1)) is the relation equivalent on set of function for all Z to Z . I find this to be equivalence relation ,but the solution says its not .ca...
User Avatar
0 votes
1 answer
110
Self doubt
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two vertices a, b, only at most one of the edges (a, b) and (b, a) is in the graph.)
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two ver...
User Avatar
1 votes
1 answer
111
Made Easy
What is meant by refinement that has been asked in this following question?
What is meant by refinement that has been asked in this following question?
User Avatar
0 votes
1 answer
112
#numbertheory
Prove that : In triangular series 1 = 1 1+2 = 3 1+2+3 = 6 1+2+3+4 = 10 ………….. Triangular number in 8n+1 always form perfect square .
Prove that :In triangular series1 = 11+2 = 31+2+3 = 61+2+3+4 = 10…………..Triangular number in 8n+1 always form perfect square .
User Avatar
0 votes
1 answer
115
Need confirmation in a Hasse Diagram about Complement of an element in Lattice
Following hasse diagram is Lattice. Is it right that complement of b – c only and complement of c – b only ?
Following hasse diagram is Lattice. Is it right that complement of b – c only and complement of c – b only ?
User Avatar
0 votes
4 answers
117
Computer Science - UGC NET 2021 [ Question ID = 2353 ]
How many ways are there to assign 5 different jobs to 4 different employees if every employee is assigned at least 1 job ? 1024 625 240 20
How many ways are there to assign 5 different jobs to 4 different employees if every employee is assigned at least 1 job ?1024 625 240 20
User Avatar
Page: