Graphs

A graph without loops and multiple edges

• Multigraphs

• Pseudo Graphs

• Simple Graphs

• Planar Graphs

The edge linking vertex to itself

• Isolated

• Connected Graphs

• Pendant

• Loop

A graph whose edges have been labeled with numbers

• Undirected graphs

• Isomorphic graphs

• Weighted graphs

• Disconnected graphs

Size of graphs

• The number of vertices

• The number of edges

• The number of degree

• The number of multiple edges

A journey with edge appears only once in the edge sequence

• Path

• Cycle

• Circuit

• Length

A path that visit Every Edge Only Once but may repeat vertices

• Euler path

• Euler circuit

• Hamilton path

• Hamilton circuit

Begin and end at the same vertex

• Hamilton path

• Hamilton circuit

• Euler circuit

• Euler path

2 graphs is said to be Isomorphic if both

• Have the same number of vertices

• Have the same number of edges

• Have the same number of degree

• All the above

A graph that can be redrawn in the plane without any edge crossing

• Complete graph

• Bipartite graph

• Discrete graph

• Planar Graph

Find the degree for vertex A Dan F

• Degree (A) = 3

• Degree (A) = 4

• Degree (F) = 3

• Degree (F) = 2