Category:Definitions/Simple Graphs
Jump to navigation
Jump to search
This category contains definitions related to Simple Graphs.
Related results can be found in Category:Simple Graphs.
A simple graph is a graph which is:
- An undirected graph, that is, the edges are defined as doubleton sets of vertices and not ordered pairs
- Not a multigraph, that is, there is no more than one edge between each pair of vertices
- Not a loop-graph, that is, there are no loops, that is, edges which start and end at the same vertex
- Not a weighted graph, that is, the edges are not mapped to a number.
Pages in category "Definitions/Simple Graphs"
The following 7 pages are in this category, out of 7 total.