Graph Theory
Home
History
Euler Graphs
Hamiltonian Graphs
Connectivity
Tree Graphs
Graph Planarity
Graph Embedding
Graph Coloring
About
Definitions and Examples
Definition of Graph
Directed and Undirected Graph
Vertex Cardinality
Neighbor Vertex and Neighborhood
Vertex Degree
Loop and Multiple Edges
Simple Graph
Connected Graph
Subgraph
About Us
Loop and Multiple Edges
A loop is an edge whose endpoints are equal i.e., an edge joining a vertex to it self is called a loop. We say that the graph has multiple edges if in the graph two or more edges joining the same pair of vertices.