Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
(a) Specify that the sum of the degrees of all vertices of a graph is double the number of edges in the graph. (b) Let G be a non directed graph with L2 edges. If G has 6 vertices every of degree 3 and the rest have degree less than 3, what is the minimum number of vertices G can have? (c) Explain the truth value for each of the following statements: (i) 4 + 3 = 6 AND 3 + 3 = 6(ii) 5 + 3 = 8 OR 3 + 1 = 5(d) Let f(n)= 5 f(n/ 2) + 3 and f(1) = 7. Find f(2k) where k is a positive integer. Also estimate f(n) if f is an increasing function. (e) Show the sufficient conditions of Dirac and Ore for a graph to be Hamiltonian. Give an instance of a graph that does not satisfy Dirac's condition, but satisfies Ore's condition. (f) Measure -25 + 75 using 2's complement.
Example: If c ≠ 0 , evaluate the subsequent integral. Solution Remember that you require converting improper integrals to limits as given, Here, do the integ
Find the remainder when 7^103 is divided by 24 Solution) we know by the concept of mod that..... 49 is congruent to 1 mod 24(means if 1 is subtracted fom 49 u get 48 which is
A mortgage lender seeks to maximize the expected value of its portfolio. The portfolio, of course, is the sum of all of the mortgages in it, so no generality is lost by examining t
what is solid geometry and uses of solid geometry
how to convert multiple integral into polar form and change the limits of itegration
Discuss demanding total market demand verus gaing market share
Although the set of integers caters to a larger audience, it is inadequate. This inadequacy has led to the formulation of Rational numbers. Rational numbers are of
solve the equation 540+115 using the NOWA method
1 ream uses 6% of a tree, Estimate the reams of paper used in one month in an office(may be your father, mother or neighbour), hence find the number of trees that need to be cut fo
Prove that A tree with n vertices has (n - 1) edges. Ans: From the definition of a tree a root comprise indegree zero and all other nodes comprise indegree one. There should
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd