Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
question let g be a graph then g is planar resp outerplanar if and only if each block of g is planar resp outerplanar
question let g be a ring graph with n ge 3 vertices and q edges if g is 2-connected and has no triangles then q le 2n -
question let g be a bipartite graph with bipartition x y prove that the largest degree of a binomial which is part of
question prove that a graph g is bipartite if and only if every cycle in some cycle basis of g is even if g is a
question an affine variety x sub kq is called a set-theoretic complete intersection if ix is a set-theoretic complete
question veronese variety let d be a positive integer and let a be the set of k-partitions of d consisting of all a
question prove that the semigroup s 4n 5n 6n is symmetric if s 5n 6n 7n 8n and k is a field prove that ks is a
question 1 farmer jimenez hides 12 decorated duck eggs all colored differently and then lets her three weasels out of a
question 1 in general which is larger chitree or chi tree explain2 consider the following printed on boxes of opti-free
question 1 let a 2k k isin zb 3k1 k isin z and c 6k5 k isin z show that abc is not a partition of z2 prove the
question 1 find a minimum-weight spanning tree of the graph shown in figure and mention which algorithm you used to
question 1 what is the smallest number greater than n that is equiv 1 mod n for a number k between 1 and n what is the
question 1 let f z rarr z be defined by fx x is f one-to-one is f onto explain why or why not in each case2 donated
question 1 let sim be an equivalence relation on a set s using the definition of equivalence class prove that ab if and
question 1 encrypt the message it was a dark and stormy night using the original vigenere cipher with key word weather2
question 1 decrypt the message ctzt dhp gkt qvym pediyk dhp jvohibs which was encrypted using the standard vigenere
question donated by dave perkins you are captured by an ogre who ties you to a chair at a table and prepares a
question give an expression for the number of banana splits you could order from 31 flavors assuming there are 3
question consider the n-cube where n ge 1 you my think of this as a graph or as a geometric object the vertices of the
question 1 prove that if a sube b then bmacr sube amacr do this once using venn diagrams and once using element
question 1 write an algorithm for generating pascals triangle2 give an example of a graph that does not have an euler
question 1 is 10 equiv 7 mod 3 what about 49 is it equiv 17 mod 222 ittw etaiz mbmit 83 in how many ways can you grab 5
question a pastry shop opens across the street from haddad library and of course it is very popular the very first day
question 1 how many different programs to do a single task can you write if there are six available algorithms for the