0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is the difference between reflection and translation?
A reflection is when you "flip" an image over a line on your graph. A translation is when you move your image vertically and/or horizontally.
What does the point N on the graph represent?
We would have to see the graph.
What does reflection mean when its used in math?
A flip over the x-axis on a graph.
What is refletion in maths mean?
A reflection of some graph about some line, like the x axis.
What tipe of equation has a graph that is hoizontal line?
This is a straight line graph with the equation, y = n where n is any positive or negative number.
What are the characteristics of the graph of the reciprocal parent function?
It is a reflection of the original graph in the line y = x.
Explain how the graph of fx ln x be used to graph the function gx ex -1?
graph gx is the reflection of graph fx and then transformed 1 unit down
How many triangles are there in a complete graph?
The number of triangles in a complete graph with n nodes is n*(n-1)*(n-2) / 6.
Which graph shows a reflection across the x-axis?
y = -f(x) is a reflection of y = f(x) in the x axis.
What is the difference between reflection and translation?
A reflection is when you "flip" an image over a line on your graph. A translation is when you move your image vertically and/or horizontally.
What does the point N on the graph represent?
We would have to see the graph.
What does reflection mean when its used in math?
A flip over the x-axis on a graph.
What would 450 be in a circle graph?
If, by circle graph, you mean a pie graph then 450 will be 360*450/n degrees where n is the sum of all the sectors of the pie.
When you graph inverse functions they have what kind of line?
A line which is the reflection of the original in y = x.
How many minimum edges in a Cyclic graph with n vertices?
The term "cyclic graph" is not well-defined. If you mean a graph that is not acyclic, then the answer is 3. That would be the union of a complete graph on 3 vertices and any number of isolated vertices. If you mean a graph that is (isomorphic to) a cycle, then the answer is n. If you are really asking the maximum number of edges, then that would be the triangle numbers such as n (n-1) /2.
What is dense graph and sparse graph?
Sparse vs. Dense GraphsInformally, a graph with relatively few edges is sparse, and a graph with many edges is dense. The following definition defines precisely what we mean when we say that a graph ``has relatively few edges'': Definition (Sparse Graph) A sparse graph is a graph in which .For example, consider a graph with n nodes. Suppose that the out-degree of each vertex in G is some fixed constant k. Graph G is a sparse graph because .A graph that is not sparse is said to be dense:Definition (Dense Graph) A dense graph is a graph in which .For example, consider a graph with n nodes. Suppose that the out-degree of each vertex in G is some fraction fof n, . E.g., if n=16 and f=0.25, the out-degree of each node is 4. Graph G is a dense graph because .
What is n in Maximum number of edges in an acyclic undirected graph with n?
n-1
