Discrete Mathematics
posted by Joy .
Using Fleury's Algorithm in the graph to the bottom left, I deleted three edges and I got the graph to the bottom right. If I am currently at the starred vertex, list all possibilities for the edge I should travel next.
Respond to this Question
Similar Questions

Algebra
Write an equation for the translation so the graph has the given vertex. 1. y=x vertex (5,0) 2. y=2x vertex (4,3) 3. y=x vertex (p,q) I really have no idea how to even begin these, but I do know the answer to # 2 is y=2x+11 … 
Vertex edge graphs
OK so my friend asked me how to solve this question i didn't know how but tried anyway and got the right answer but i want to know if i did it correctly 6 boys are working on 5 go carts. each boy works on more than one cart. it takes … 
heelp math
A graph is constructed iteratively according to the following algorithm. The graph starts as a single vertex. With probability p, the graph stops here. Otherwise, 3 new vertices are constructed and joined to this vertex. If we have … 
Discrete Mathematics
Consider the complete graph with 5 vertices, denoted by K5. A. Draw the graph. B. How many edges are in K5? 
Discrete Mathematics
Let G be a graph with vertex set V = {v1, v2, v3, v4, v5}. If the degrees of the vertices are 1, 2, 3, 4, 6, respectively, how many edges are in G? 
Discrete Mathematics
Using Fleury's Algorithm in the graph to the bottom left, I deleted three edges and I got the graph to the bottom right. If I am currently at the starred vertex, list all possibilities for the edge I should travel next. 
Discrete Mathematics
If we consider the G as the whole of the cycle graph having 4 edges then is G a complete graph? 
PreCalculus
Hello! I need help with these 2 questions: 1.) Describe how the graphs of f(x) = 2x and g(x) = 2x are related. a.) All of these. b.) The graph of g(x) is a reflection of the graph of f(x) over the yaxis. c.) Non of these. d.) … 
Graph Theory/ Algorithms / Computer science
I am working on this problem from the book, Data Structures & Algorithm Analysis in C++. The problem is: 9.40 Give a polynomialtime algorithm that ﬁnds ceil(V /2) vertices that collectively cover at least threefourths (3/4) … 
MATH
Graph is a complete graph it called K6 IT HAS 6 VETICES. also, every vertex is connected to every other vertex. a) how many possible Hamilton circuits ( say starting from A) including reversals, does the graph have?