answersLogoWhite

0

There are various types of graphs. You need to be more specific. Graphs exist for thousands of subjects, and each one is different. But, basically, you need to gather all verifiable information on the subject in question before you begin.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

Do graphs represent equations?

Bar graphs and line graphs do not. Straight line, parabolic, and hyperbolic graphs are graphs of an equation.


How are bar graphs and line graphs and circle graphs different?

circle graphs add up to 100% , bar and line graphs don't


What is a type of graphical graph?

All graphs are graphical graphs because if they were not graphical graphs they would not be graphs!


What are the three types of graphs scientist use?

Pie Graphs, Bar Graphs, and Line Graphs are three graphs that scientist use often.


What are the two main types of graphs?

Bar graphs and line graphs.


How do graphs represent motion?

The answer depends on what information is graphed. There are distance-time graphs, velocity-time graphs, speed-time graphs, acceleration-time graphs.


What types of graphs are there?

line graphs bar graphs pictographs you are really sexy


What are misleading graphs?

they are graphs that are misleading


What graphs measure?

pie graphs


Determine the inequality of the graphs?

what graphs


What Tree types of graphs to display data?

line graphs, bar graphs,and circle


What are the relations to each type of graphs?

Graphs can be categorized into various types, including directed and undirected graphs, weighted and unweighted graphs, and cyclic and acyclic graphs. Directed graphs have edges with a specific direction, while undirected graphs have edges that do not have a direction. Weighted graphs assign values to edges, indicating costs or distances, whereas unweighted graphs treat all edges equally. Cyclic graphs contain at least one cycle, while acyclic graphs do not, which is crucial in applications like tree structures and scheduling problems.