Graphs

• The fundamental units of the graph

• Edges

• vertices

• Line

• arch

A graph with no edges is called?

• Directed Graph

• Trivial Graph

• Null Graph

• Undirected Graph

The graph in which at least one node is not reachable from node.

• Disconnected Graph

• Connected Graph

• Directed Graph

• Regular Graph

The graph in which from each node there is an edge to each other node.

• Cycle Graph

• Regular Graph

• Complete Graph

• Cyclic Graph

A graph containing at least one cycle

• Bipartite Graph

• Regular Graph

• Cycle Graph

• Cyclic Graph

A graph in which vertex can be divided into two sets such that vertex in each set does not contain any edge between them.

• Directed Acyclic Graph

• Bipartite Graph

• Weighted Graph

• Cyclic Graph

• ➤A graph containing at least one cycle is known as a Cyclic graph.

• • Cyclic Graph

• Cycle Graph

• Adjacency List

• Adjacency Matrix

• Graphs can be used to represent the topology of computer networks, such as the connections between routers and switches

• True

• False

• Graphs are used to represent the connections between different places in a transportation network, such as roads and airports.

• True

• False

• Edges represent states the robot can be in and the Vertices the possible transitions between the states.

• True

• False