Category:Simple Graphs
Jump to navigation
Jump to search
This category contains results about Simple Graphs.
Definitions specific to this category can be found in Definitions/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.
Subcategories
This category has the following 2 subcategories, out of 2 total.
E
- Examples of Simple Graphs (3 P)
Pages in category "Simple Graphs"
The following 8 pages are in this category, out of 8 total.