gives the underlying simple graph from the graph g.
uses rules vw to specify the graph g.
Details and Options
- SimpleGraph[g] removes all self-loops and multiple edges between the same vertices.
- SimpleGraph preserves directed edges as directed. UndirectedGraph can be used to compute the underlying undirected graph.
- SimpleGraph works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Basic Examples (1)
Remove self-loops from a graph:
Properties & Relations (7)
Introduced in 2010
Updated in 2015