IsSimpleGraph

Whether a Graph has no self-loop and no parallel (repeated) edge.

✓ checked against that system · ! checked, with disagreements (hover a chip)Wolfram LanguageSimpleGraphQ✓↗

IsSimpleGraph(g)true iff g has no self-loop and no two edges with the same endpoints and the same direction-ness.

Typed signatures

Type	Package	Applies
(value) -> boolean	combinatorics	always

Domain: Collections

Details

• Wolfram calls this SimpleGraphQ; this library uses the Is… spelling everywhere.
• A directed edge and its own reverse (a->b and b->a) are DIFFERENT edges, not a parallel pair -- both can be present in a simple directed graph. Two copies of the SAME undirected edge, or the same directed edge twice, are parallel.

Examples

Basic #

live ↗

In$\mathrm{IsSimpleGraph}(\mathrm{CompleteGraph}(3))$Out$\mathrm{True}$

live ↗

In$\mathrm{IsSimpleGraph}(\mathrm{Graph}(\bigl\lbrack\mathrm{UndirectedEdge}(1, 2), \mathrm{UndirectedEdge}(2, 1)\bigr\rbrack))$Out$\mathrm{False}$

About

Examples	2
Checked against	Wolfram Language 2 agreeSageMath 2 agree
Crosswalk	Wolfram Language

Implementation

mappedsagepackages/oracle/src/mappings.ts

See also: IsLoopFreeGraph, IsCompleteGraph