Random Subgraph of a Complete Graph

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

A complete graph is an undirected graph with each pair of vertices connected by a single edge. This Demonstration randomly highlights subgraphs of a complete graph.

Contributed by: Vitaliy Kaurov (July 2011)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.