A graph that can be drawn without any edges crossing is called:A. Planar graphB. Bipartite graphC. Connected graphD. Regular graph

Step 1: Break Down the Problem

To determine the correct answer, we need to analyze the definitions of each type of graph mentioned in the options.

Step 2: Relevant Concepts

1. Planar Graph: A graph that can be drawn on a plane without any edges crossing.
2. Bipartite Graph: A type of graph where the vertex set can be divided into two distinct sets so that no two graph vertices within the same set are adjacent.
3. Connected Graph: A graph where there is a path between any two vertices.
4. Regular Graph: A graph where each vertex has the same number of edges, or degree.

Step 3: Analysis and Detail

• A planar graph specifically addresses the condition of being drawable without overlapping edges, which matches the statement in the question.
• The other types of graphs do not inherently imply the condition of non-crossing edges. For example, a bipartite graph can be non-planar, a connected graph can have edges crossing if drawn in certain ways, and a regular graph does not guarantee non-crossing edges.

Step 4: Verify and Summarize

Given the definitions, the statement in the question accurately describes a planar graph. No other option fulfills the criteria of being drawable without edges crossing.

Final Answer

A. Planar graph