Title

Using combinatorica/mathematica for student projects in random graph theory

Document Type

Article

Publication Date

1-1-2006

Abstract

We give an example of a student project that experimentally explores a topic in random graph theory. We use the Combinatorica package in Mathematica to estimate the minimum number of edges needed in a random graph to have a 50 percent chance that the graph is connected. We provide the Mathematica code and compare it to the known theoretical result. © 2006 Taylor & Francis Group, LLC.

Publication Name

PRIMUS

Volume Number

16

First Page

314

Last Page

319

Issue Number

4

DOI

10.1080/10511970608984154

This document is currently not available here.

Share

COinS