answersLogoWhite

0


Best Answer

y=-2x^2+8x+3

User Avatar

Wiki User

9y ago
This answer is:
User Avatar
More answers
User Avatar

Anonymous

Lvl 1
3y ago

5

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is the vertex of the graph y-2x2 8x-3?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is a cycle in graph theory?

If the graph start and end with same vertex and no other vertex can be repeated then it is called trivial graph.


How do you graph parabola given its vertex?

The vertex of a parabola doe not provide enough information to graph anything - other than the vertex!


What point on the graph could be the fourth vertex of the parallelogram?

the origin is the point in the graph that can be fourth vertex


What is the highest or lowest point on a graph called?

The vertex is the highest or lowest point on a graph.


What is a pendent vertex?

A vertex of a graph is said to be pendant if its neighborhood contains exactly one vertex.


How do you know if the vertex is maxinum or mininum?

If the arrows of the graph point down, then the vertex is a maximum because it is the greatest point on the graph. If the arrows point up, then the vertex is the minimum because it is the lowest point.


What is the defenishon of vertex?

If you are referring to graphs of quadratic functions such as parabolas; the vertex is the highest or lowest point on the graph. In another field of math known as graph theory, the vertex has an entirely different meaning. There is refers to the fundamental unit of which the graph is composed. It is like a node.


What degree of a vertex would lead to a vertex edge graph unable to be traveled?

2


A circuit in a connected graph which includes every vertex of the graph is known?

Eular


Graph y2x2-12x plus 17?

Do you mean y2=x2-12x+17 Well you take the square root from both sides to get y by itself.


What is a biclique?

A biclique is a term used in graph theory for a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set.


Define walk path and connected graph in an algorithm?

A "walk" is a sequence of alternating vertices and edges, starting with a vertex and ending with a vertex with any number of revisiting vertices and retracing of edges. If a walk has the restriction of no repetition of vertices and no edge is retraced it is called a "path". If there is a walk to every vertex from any other vertex of the graph then it is called a "connected" graph.