Multigraph

DOWNLOAD Mathematica Notebook Multigraph

The term multigraph refers to a graph in which multiple edges between nodes are either permitted (Harary 1994, p. 10; Gross and Yellen 1999, p. 4) or required (Skiena 1990, p. 89, Pemmaraju and Skiena 2003, p. 198; Zwillinger 2003, p. 220). West (2000, p. xiv) recommends avoiding the term altogether on the grounds of this ambiguity.

Some references require that multigraphs possess no graph loops (Harary 1994, p. 10; Gross and Yellen 1999, p. 4; Zwillinger 2003, p. 220), some explicitly allow them (Hartsfield and Ringel 1994, p. 7; Cormen et al. 2001, p. 89), and yet others do not include any explicit allowance or disallowance (Skiena 1990, p. 89; Gross and Yellen 1999, p. 351; Pemmaraju and Skiena 2003, p. 198). Worse still, Tutte (1998, p. 2) uses the term "multigraph" to mean a graph containing either loops or multiple edges.

As a result of these many ambiguities, use of the term "multigraph" should be deprecated, or at the very least used with extreme caution.

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.