Maple and graph theory

Maple has a graph theory package, which allows me to take a scale and compute its connectivity fairly easily. What does Matlab, etc. have?

--- In tuning-math@y..., "genewardsmith" <genewardsmith@j...> wrote:

> Maple has a graph theory package, which allows me to take a scale
>and compute its connectivity fairly easily.

Is this the same as Dave Keenan's connectivity?

>What does Matlab, etc. have?

I'm not sure if Matlab has a graph theory toolbox, but I probably
wouldn't be willing to pay for it anyway. Look at the Matlab website -
- I have the basic package, plus the optimization and statistics
toolboxes.

--- In tuning-math@y..., "paulerlich" <paul@s...> wrote:
> --- In tuning-math@y..., "genewardsmith" <genewardsmith@j...> wrote:
>
> > Maple has a graph theory package, which allows me to take a scale
> >and compute its connectivity fairly easily.
>
> Is this the same as Dave Keenan's connectivity?

Almost certainly not. I assume you are referring to where I say e.g. a
meantone diatonic scale is 86% connected at the 9-limit. Which means
that of the 21 possible dyads (considered octave-equivalently) 18 of
them are (reasonable approximations of) 9-limit ratios.

I assume that Gene's measure gave the number of connected subgraphs
that were disconnected from each other.

--- In tuning-math@y..., "dkeenanuqnetau" <d.keenan@u...> wrote:

> I assume that Gene's measure gave the number of connected subgraphs
> that were disconnected from each other.

It's edge-connectivity--the number of edges which would need to be removed to make the graph disconnected.