Graph-theoretic properties of scales: Difference between revisions

: This revision was by author [[User:guest|guest]] and made on <tt>2012-08-26 21:30:18 UTC</tt>.<br>

The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br>

<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;white-space: pre-wrap ! important" class="old-revision-html">[[toc]]

=Graph of a scale=  

We now may define the **graph of the scale**, which more precisely is the graph G = G(S, C) of the scale S together with the consonance set C. This means G is a (simple) [[http://en.wikipedia.org/wiki/Graph_%28mathematics%29|graph]] in the sense of [[http://en.wikipedia.org/wiki/Graph_theory|graph theory]]. The vertices of G, V(G), is the set S of pitch classes, and an edge is drawn between two distinct pitch classes r and s if X⋂C ≠ ∅, where X = {x/y|x∊r, y∊s}. This means that there is a relation of consonance, as defined by C, between the pitch classes r and s. It should be noted that we have defined things assuming pitches are given multiplicatively, but we can equally well express them in logarithmic terms as for instance by cents or by steps of an [[EDO]].

=Connectivity=  

We can attribute various properties to a scale, given a choice of consonance set, by the presence of a graph-theoretic property in the graph of the scale. One key graph-theoretic property is connectivity. A graph is said to be //connected// if for any two vertices a and b, there is a path of edges between a and b. A scale is therefore connected if you can go from any one note to any other note by means of consonant intervals only. The graph G has an edge-connectivity ε if it is possible to disconnect the graph by removing ε edges, but no smaller number of edges will do. Similarly, it has vertex-connectivity ν if it is possible to disconnect the graph by removing ν vertices (notes of the scale) but no smaller number will do. The graph is //k-edge-connected// if ε ≥ k, and //k-vertex-connected// if ν ≥ k; these definitions transfer immediately to scales, and a high degree of connectivity may often be desired in a scale.

A [[http://en.wikipedia.org/wiki/Clique_%28graph_theory%29|clique]] in a graph is a subgraph such that there is an edge connecting every vertex; that is, the subgraph is a complete graph. In music terms, a clique is a [[dyadic chord]]. Hence, counting cliques of various degrees (number of notes) is a relevant consideration when analyzing a scale. The various problems of this nature are called, collectively, the [[http://en.wikipedia.org/wiki/Clique_problem|clique problem]], and this unfortunately is computationally hard. However, for scales of the size most people would care to consider a brute-force approach suffices.

Among all cliques, the [[http://mathworld.wolfram.com/MaximalClique.html|maximal cliques]], those not contained in larger cliques, are of special interest; they might be regarded as the basic chords of the scale. A //maximum clique// is a clique of largest size; these are always maximal but the converse does not always hold. Given any set of sets, we may form a graph with these as the set of vertices, by drawing an edge between any two sets with a nonempty intersection. In this way we can create graphs of all k-cliques (k note dyadic chords), maximal k-cliques, all maximal cliques, and so forth. Such graphs can illuminate harmonic relationships.

=The Characteristic Polynomial=  

The [[http://en.wikipedia.org/wiki/Adjacency_matrix|adjacency matrix]] A of a graph is the square symmetric matrix with zeros on the diagonal, with 1 at the (i, j) place if the ith vertex is connected to the jth vertex, and 0 if it is not. The [[http://en.wikipedia.org/wiki/Characteristic_polynomial|characteristic polynomial]] of a graph is the characteristic polynomial det(xI - A) of its adjacency matrix, and is a property (graph invariant) of the graph alone, without consideration of how the vertices are numbered. The degree n-1 term is 0, the n-2 term is minus the number of edges of the graph and therefore dyads of the scale, and the n-3 term minus twice the number of triads (3-cliques) in the graph and therefore the scale.

These properties can be also expressed in terms of the roots of the characteristic polynomial, which are the eigenvalues of the matrix. These roots are real numbers, some of which may be multiple. The //spectrum// of G is the [[http://en.wikipedia.org/wiki/Multiset|multiset]] of roots, including multipicities, so that some roots may be repeated. From [[http://en.wikipedia.org/wiki/Newton%27s_identities|Newton's identities]] we can also say that the sum of the squares of the spectrum is twice the number of edges of the graph, which means twice the number of dyads of the scale, and the sum of the cubes of the spectrum is six times the number of triads of the scale. In terms of the adjacency matrix A, the number of dyads is tr(A^2)/2 and the number of triads is tr(A^3)/6, where "tr" denotes the trace. Since tr(A^2)/V, where V is the degree (number of notes) is the variance of the spectrum, we can see we prefer the variance to be larger rather than smaller. Also, tr(A^3)/V divided by the 3/2 power of the variance is the skewness of the spectrum, from which we can conclude we want the skewness to skew positive.

The epitome of these properties is found in the complete graph, which in scale terms means every note is in consonant relation with every other--in other words, the scale is a dyadic chord. This has a spectrum with V-1 values of -1 and one of V-1. The [[http://en.wikipedia.org/wiki/Distance_%28graph_theory%29|distance]] between two vertices (notes) is the number of edges (consonant intervals) of the shortest path between then, and the [[http://mathworld.wolfram.com/GraphDiameter.html|diameter]] of a graph is the length of the greatest distance between two vertices, while the radius is the minimax distance--the minimum over all vertices of its maximum distance to any other vertex. The diameter of a compete graph is 1, and in general a small diameter is another desirable quality. A graph with diameter d must have at least d+1 distinct values in the spectrum.

=The Laplace Spectrum=  

If D is the diagonal matrix [Dij], with Dii being the degree of the ith vertex--that is, the number of edges connecting to that vertex--then L = D - A is called the [[http://en.wikipedia.org/wiki/Laplacian_matrix|Laplace matrix]] of the graph G, and its eigenvalues (roots of its characteristic polynomial) is the //Laplace spectrum//. The matrix L is positive-semidefinite; the Laplace spectrum has at least one zero value, with the other values real and non-negative; the number of zero values in the Laplace spectrum is equal to the number of connected components of G, and so there is just one iff G is connected. The second smallest member λ of the Laplace spectrum, which is therefore positive iff G is connected, is called the [[http://en.wikipedia.org/wiki/Algebraic_connectivity|algebraic connectivity]]. The various kinds of connectivity are related by the inequality λ ≤ ν ≤ ε; that is the algebraic connectivity is less than or equal to the vertex connectivity, which is less than or equal to the edge connectivity. In the other direction, λ ≥ 2(1 - cos(π/V))ε, where V is the number of vertices; consequently λ &gt; (π/V)^2 ε.

The sum of the Laplace spectrum, which is tr(L), is twice the number of edges (dyads.) Just as with the ordinary spectrum, the Laplace spectrum has at least d+1 distinct values for a graph of diameter d. The largest value in the Laplace spectrum is less than or equal to V, the degree of the graph, meaning the size of the scale; and is equal iff the complementary graph is disconnected, where the complementary graph is the graph of non-consonant relations, that is, the graph which has an edge between two vertices iff G doesn't.

=The Genus=  

A graph is [[http://en.wikipedia.org/wiki/Planar_graph|planar]] if it can be drawn on a plane, or equivalently on a sphere, in such a way that no edges cross. Not all graphs can be drawn without edge crossings on a sphere, but they all can be drawn without crossings on a suitable [[http://en.wikipedia.org/wiki/Compact_space|compact]][[http://en.wikipedia.org/wiki/Orientability|orientable]] [[http://en.wikipedia.org/wiki/Surface|surface]] with "donut holes", which we may view as a closed and bounded surface in 3 dimensional Euclidean space. If a surface has g holes, it is of [[http://mathworld.wolfram.com/GraphGenus.html|genus]] g, where the sphere (or plane) has genus 0. The minimum number of holes needed to draw the graph is the genus of the graph.

Drawing (embedding) the graph on a surface with no crossings would give a nice visual picture of the harmonic relations in a scale. Moreover, such an embedding can be converted into a planar diagram by allowing the depiction of some of the vertices in more than one place, on the edge of the diagram. Unfortunately, the problem of determining the genus and finding such an embedding is [[http://en.wikipedia.org/wiki/NP-complete|NP-complete]]. However, finding bounds on the genus is a much easier problem. For very small scales, the genus routine of [[http://www.sagemath.org/|SAGE]] can manage to finish computing after an acceptable amount of time.

If the genus is g, the graph can also be drawn on any surface of genus greater than g; one way to accomplish that, but not the only way, is simply not to use more than g of the holes--that is, not to draw an edge passing through it. In fact, beyond a certain point you would not be able to use all of the holes and would have to leave some without edges drawn through them. The maximum number of holes, all of which can actually be used by having an edge pass through them, is called the maximal genus an is another invariant of the graph.

A 5-limit JI scale, meaning a scale composed of 5-limit JI intervals such that {6/5, 5/4, 4/3, 3/2, 8/5, 5/3} is the consonance set, is always planar. This because the [[http://xenharmonic.wikispaces.com/file/detail/hexagonal-lattice.gif|hexagonal lattice]] of 5-limit pitch classes is planar, and the graph of any scale will simply be a finite subgraph of that lattice, considered as a graph. On the other hand, a non-contorted 5-limit scale in any equal temperament will be of genus 1, since the two commas serve as boundaries for a parallelogram which defines a torus (we can visualize this as rolling it up and glueing ends together.)

[[image:pentad.gif]]

If V is the number of notes (vertices) of the scale, and E the number of dyads (edges), then the maximum value for E is C(V, 2) = V(V - 1)/2. This suggests the definition for [[http://en.wikipedia.org/wiki/Dense_graph|graph density]], 2E/(V(V-1)). Since the maximum number of edges for a genus 0 graph with V&gt;2 is 3V - 6, the maximum density for a genus 0 graph is 6(V-2)/(V(V-1)) which has series expansion 6/V - 6/V^2 - 6/V^3 ...; if the density is 6/V or greater the graph must be of a higher genus, hence, higher genus scales are to be expected in music. If each note is harmonically related to at least three other notes, an obviously desirable property which in graph-theoretic language means the minimum degree is greater than two, then the genus g ≥ E/6 - V/2 + 1. On the other hand, for a connected graph we have g ≤ (E - V + 1)/2

=The Automorphism Group=  

If A is the adjacency matrix, which is a VxV square matrix, the [[http://en.wikipedia.org/wiki/Graph_automorphism|automorphism group]] Aut(G) of the graph G is given explicitly by the set {P|P⋅A = A⋅P} of VxV [[http://en.wikipedia.org/wiki/Permutation_matrix|permutation matrices]] which commute with A. Equivalently, it is the set {P|A = P⋅A⋅P^(-1)}, where A is identical to itself under a similarity transformation. For most graphs, the automorphism group is trivial; however this is often not the case for graphs of scales. For instance, a symmetric scale such that if s is in the scale, then so is its octave inversion 2/s, will have an element of order 2 in its automorphism group. A MOS will always have an element of order 2, resulting from some composition of inversion and translation. Graph automorphisms such as these preserve the property of being a dyadic chord, making such things of considerable musical interest.

If the spectrum of the graph contains no repeated values, then Aut(G) is an [[http://en.wikipedia.org/wiki/Elementary_abelian_group|elementary abelian 2-group]], meaning all non-identity elements are of order 2. Hence for the more interesting automorphism groups, including non-abelian groups, we need repeated values in the spectrum; in other words eigenvalues with multiplicity greater than one corresponding to eigenspaces with dimension greater than one.

=Examples=  

==The Zarlino scale==  

The Zarlino scale, or "just diatonic" as it's often called, is the scale 1-9/8-5/4-4/3-3/2-5/3-15/8-2, with three major and two minor triads. It has a characteristic polynomial x(x+1)(x^2-3)(x^3-x^2-7*x-3) = x^7 - 11x^5 - 10x^4 + 21x^3 + 30x^2 + 9x. From the coefficients of this we can read off that it has 11 dyads and 5 triads, and from the roots, we find that its automorphism group is an elementary 2-group--in fact, it is of order 2, with the nontrivial automorphism being inversion. The three connectivities, algebraic, vertex, and edge, are 0.914 ≤ 2 ≤ 2. The scales radius is 2 and its diameter is 3. Its genus, of course, is 0, but less obviously its maximal genus is 2.

[[image:zarlino.png]]

==The diatonic scale (Meantone[7])==  

The diatonic scale in 31edo consists of the notes 0, 5, 10, 13, 18, 23, 28, 31. In the 7-limit, it has the consonance set {6, 7, 8, 10, 13, 15, 16, 18, 21, 23, 24, 25}, leading to a graph with the high degree of symmetry afforded by the dihedral group of order 14. This graph is in fact isomorphic to the graph of (5 or 7 limit) 7edo. The maximal cliques of the graph are the seven dyadic chord triads, one on each degree of the scale; three major, three minor, and one diminished. Because of the graph symmetry, the 7-limit diatonic scale can transpose to any key, mapping all dyadic triads to other dyadic triads.

[[image:diatonic7.png]]

==Star==  

[[Star]] is a scale of [[Starling temperaments#Valentine%20temperament-11-limit|11-limit valentine temperament]], which in [[77edo|77et]] is 0, 5, 20, 25, 40, 45, 57, 65, 77, with the 11-limit consonance set {10, 12, 13, 15, 17, 20, 22, 25, 27, 28, 32, 35, 37, 40, 42, 45, 49, 50, 52, 55, 57, 60, 62, 64, 65, 67}. Its eight vertices are connected via 24 edges. The scale exhibits a very high degree of symmetry, with an automorphism group of order 384, the 8T44 transitive group [2^4]S4. Its graph is 6-regular, with every vertex connected to six others, and its algebraic, vertex and edge connectivities are all 6. The largest element of the Laplace spectrum is 8, so its complementary graph is not connected. It has 16 maximal cliques, all of which are tetrads, and the automorphism group acts faithfully on the tetrads.

[[image:star.png]]

==Oktone==  

By [[oktone]] is meant the tempering of the octone scale, 1-15/14-60/49-5/4-10/7-3/2-12/7-7/4-2, in [[Breed family#Jove,%20aka%20Wonder|jove temperament]]. The tempering can be accomplished via [[202edo|202et]], leading to the scale 0, 20, 59, 65, 104, 118, 157, 163, 202 which we can use together with the 11-limit diamond as a consonance set, {25, 28, 31, 34, 39, 45, 53, 59, 65, 70, 73, 84, 93, 98, 104, 109, 118, 129, 132, 137, 143, 149, 157, 163, 168, 171, 174, 177}. This leads to a highly accurate scale with a good deal of symmetry. The automorphism group of the graph is the direct product of the group of the square with an involution, ie an element of order two. The involution simultaneously exchanges notes 2 and 7, and 3 and 6; that is, it is in cycle terms (2, 7)(3,6), or (59, 163)(65, 157) in terms of 202et, and the square part permutes the cycle (0, 4, 1, 5) by the group of the square.

[[image:oktony.png]]

==Orwell[9]==  

Orwell[9], the 9-note orwell MOS, has notes 0, 5, 12, 17, 24, 29, 36, 41, 48, 53 in [[53edo|53 equal]]. With the 11-limit consonance set {7, 8, 9, 10, 12, 14, 15, 17, 19, 22, 24, 26, 27, 29, 31, 34, 36, 38, 39, 41, 43, 44, 45, 46} it defines a graph of 31 edges with an automorphism group of order 96. The group consists of an [[http://mathworld.wolfram.com/OctahedralGroup.html|octahedronal group]] part which is transitive on the six notes from 2 to 7, that is {12, 17, 24, 29, 36, 41} of 53edo, generated by (2,3), (4,5),(6,7), (2,4)(3,5) and (4,6)(5,7), and an involution exchanging notes 1 and 8, that is, 5 and 48 of 53edo. The center of the MOS, note 0 in this numbering, stays where it is, and has degree six whereas all the other notes are degree seven.

[[image:orwell9.png]]

==The dekany==  

The standard 2)5 dekany is a [[Combination product sets|combination product set]], Cps([2,3,5,7,11], 2). It consists of ten notes associated to two-element subset of the set of the first five primes, {2,3,5,7,11}, and in one mode is 1-12/11-5/4-14/11-15/11-3/2-35/22-7/4-20/11-21/11, which we will take as its notes from note 0 to note 9. It has 30 edges, with connectivities 5 ≤ 6 ≤ 6, and the largest element of the Laplace spectrum is 8, so that the complementary graph is also connected. Its radius and diameter are both 2. The graph is known as the [[http://en.wikipedia.org/wiki/Johnson_graph|Johnson graph]] J(5,2). The 3)5 dekany, which is the inverse of the standard dekany, has the Johnson graph J(5,3) as its graph, which is graph-isomorphic to J(5,2).

[[image:dekany.png]]

The Ellis duodene is the 12-note 5-limit scale 1-16/15-9/8-6/5-5/4-4/3-45/32-3/2-8/5-5/3-9/5-15/8-2, and marvel tempering it leads to [[The Marveldene|marveldene]]. An excellent tuning for marvel is [[166edo|166et]], and in that the scale becomes 0, 16, 28, 44, 53, 69, 81, 97, 113, 122, 141, 150, 166. If we use the 15-limit consonance set, {16, 18, 19, 21, 23, 25, 28, 32, 34, 37, 40, 44, 48, 50, 53, 58, 60, 63, 69, 74, 76, 78, 81, 85, 88, 90, 92, 97, 103, 106, 108, 113, 116, 118, 122, 126, 129, 132, 134, 138, 141, 143, 145, 147, 148, 150}, we obtain a graph with 55 edges and an automorphism group of order 32. Abstractly, the automorphism group is the direct product of the group of the square with the Klein 4-group; as a permutation group it is the square (dihedral group D8 of order 8) part, generated by {(1,2)(5,6)(8,11)(9,10), (1,5), (2,6)}, and the two involutions flipping two notes, (3,4) flipping Eb and E, and (7,12) flipping C and G.

The connectivites of the marveldene go 6.222 ≤ 7 ≤ 8, and it has a radius of 1 and a diameter of 2, with center {0, 7}, ie C and G. The largest element of the Laplace spectrum is 12, so the complementary graph is not connected. It has eight maximum cliques, the septads [0, 1, 3, 5, 7, 8, 11], [0, 1, 3, 5, 7, 9, 11], [0, 1, 4, 5, 7, 8, 11], [0, 1, 4, 5, 7, 9, 11], [0, 2, 3, 6, 7, 8, 10], [0, 2, 3, 6, 7, 8, 11], [0, 2, 4, 6, 7, 8, 10] and [0, 2, 4, 6, 7, 8, 11], and two maximal pentads, [0, 3, 7, 9, 10] and [0, 4, 7, 9, 10].

==Magic[13]==  

Magic[13] is the 13-note MOS of [[Magic family#Magic-11-limit|magic temperament]], which in [[104edo|104et]] has notes 0, 5, 10, 28, 33, 38, 43, 61, 66, 71, 76, 94, 99, 104. Using the 11-limit diamond, {13, 15, 15, 18, 20, 23, 28, 30, 33, 36, 38, 43, 48, 51, 53, 56, 61, 66, 68, 71, 74, 76, 81, 84, 86, 89, 89, 91} as the consonance set, we obtain a graph on 13 notes with 61 edges representing dyads. It has algebraic, vertex and edge connectivities all 8, and a disconnected graph complement. The radius and diameter are both 2.

==Orwell[13]==  

The graph of Orwell[13] is 10-regular, has 65 edges, with connectivities 9.058 ≤ 10 ≤ 10, and radius and diameter both 2.</pre></div>

&lt;!-- ws:end:WikiTextTocRule:40 --&gt;&lt;!-- ws:start:WikiTextTocRule:41: --&gt;&lt;div style="margin-left: 2em;"&gt;&lt;a href="#Examples-The diatonic scale (Meantone[7])"&gt;The diatonic scale (Meantone[7])&lt;/a&gt;&lt;/div&gt;

We now may define the &lt;strong&gt;graph of the scale&lt;/strong&gt;, which more precisely is the graph G = G(S, C) of the scale S together with the consonance set C. This means G is a (simple) &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Graph_%28mathematics%29" rel="nofollow"&gt;graph&lt;/a&gt; in the sense of &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Graph_theory" rel="nofollow"&gt;graph theory&lt;/a&gt;. The vertices of G, V(G), is the set S of pitch classes, and an edge is drawn between two distinct pitch classes r and s if X⋂C ≠ ∅, where X = {x/y|x∊r, y∊s}. This means that there is a relation of consonance, as defined by C, between the pitch classes r and s. It should be noted that we have defined things assuming pitches are given multiplicatively, but we can equally well express them in logarithmic terms as for instance by cents or by steps of an &lt;a class="wiki_link" href="/EDO"&gt;EDO&lt;/a&gt;.&lt;br /&gt;

The epitome of these properties is found in the complete graph, which in scale terms means every note is in consonant relation with every other--in other words, the scale is a dyadic chord. This has a spectrum with V-1 values of -1 and one of V-1. The &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Distance_%28graph_theory%29" rel="nofollow"&gt;distance&lt;/a&gt; between two vertices (notes) is the number of edges (consonant intervals) of the shortest path between then, and the &lt;a class="wiki_link_ext" href="http://mathworld.wolfram.com/GraphDiameter.html" rel="nofollow"&gt;diameter&lt;/a&gt; of a graph is the length of the greatest distance between two vertices, while the radius is the minimax distance--the minimum over all vertices of its maximum distance to any other vertex. The diameter of a compete graph is 1, and in general a small diameter is another desirable quality. A graph with diameter d must have at least d+1 distinct values in the spectrum.&lt;br /&gt;

If D is the diagonal matrix [Dij], with Dii being the degree of the ith vertex--that is, the number of edges connecting to that vertex--then L = D - A is called the &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Laplacian_matrix" rel="nofollow"&gt;Laplace matrix&lt;/a&gt; of the graph G, and its eigenvalues (roots of its characteristic polynomial) is the &lt;em&gt;Laplace spectrum&lt;/em&gt;. The matrix L is positive-semidefinite; the Laplace spectrum has at least one zero value, with the other values real and non-negative; the number of zero values in the Laplace spectrum is equal to the number of connected components of G, and so there is just one iff G is connected. The second smallest member λ of the Laplace spectrum, which is therefore positive iff G is connected, is called the &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Algebraic_connectivity" rel="nofollow"&gt;algebraic connectivity&lt;/a&gt;. The various kinds of connectivity are related by the inequality λ ≤ ν ≤ ε; that is the algebraic connectivity is less than or equal to the vertex connectivity, which is less than or equal to the edge connectivity. In the other direction, λ ≥ 2(1 - cos(π/V))ε, where V is the number of vertices; consequently λ &amp;gt; (π/V)^2 ε.&lt;br /&gt;

If A is the adjacency matrix, which is a VxV square matrix, the &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Graph_automorphism" rel="nofollow"&gt;automorphism group&lt;/a&gt; Aut(G) of the graph G is given explicitly by the set {P|P⋅A = A⋅P} of VxV &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Permutation_matrix" rel="nofollow"&gt;permutation matrices&lt;/a&gt; which commute with A. Equivalently, it is the set {P|A = P⋅A⋅P^(-1)}, where A is identical to itself under a similarity transformation. For most graphs, the automorphism group is trivial; however this is often not the case for graphs of scales. For instance, a symmetric scale such that if s is in the scale, then so is its octave inversion 2/s, will have an element of order 2 in its automorphism group. A MOS will always have an element of order 2, resulting from some composition of inversion and translation. Graph automorphisms such as these preserve the property of being a dyadic chord, making such things of considerable musical interest.&lt;br /&gt;

&lt;!-- ws:start:WikiTextHeadingRule:16:&amp;lt;h2&amp;gt; --&gt;&lt;h2 id="toc8"&gt;&lt;a name="Examples-The diatonic scale (Meantone[7])"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:16 --&gt;The diatonic scale (Meantone[7])&lt;/h2&gt;

&lt;a class="wiki_link" href="/Star"&gt;Star&lt;/a&gt; is a scale of &lt;a class="wiki_link" href="/Starling%20temperaments#Valentine%20temperament-11-limit"&gt;11-limit valentine temperament&lt;/a&gt;, which in &lt;a class="wiki_link" href="/77edo"&gt;77et&lt;/a&gt; is 0, 5, 20, 25, 40, 45, 57, 65, 77, with the 11-limit consonance set {10, 12, 13, 15, 17, 20, 22, 25, 27, 28, 32, 35, 37, 40, 42, 45, 49, 50, 52, 55, 57, 60, 62, 64, 65, 67}. Its eight vertices are connected via 24 edges. The scale exhibits a very high degree of symmetry, with an automorphism group of order 384, the 8T44 transitive group [2^4]S4. Its graph is 6-regular, with every vertex connected to six others, and its algebraic, vertex and edge connectivities are all 6. The largest element of the Laplace spectrum is 8, so its complementary graph is not connected. It has 16 maximal cliques, all of which are tetrads, and the automorphism group acts faithfully on the tetrads.&lt;br /&gt;

&lt;!-- ws:start:WikiTextHeadingRule:22:&amp;lt;h2&amp;gt; --&gt;&lt;h2 id="toc11"&gt;&lt;a name="Examples-Orwell[9]"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:22 --&gt;Orwell[9]&lt;/h2&gt;

Orwell[9], the 9-note orwell MOS, has notes 0, 5, 12, 17, 24, 29, 36, 41, 48, 53 in &lt;a class="wiki_link" href="/53edo"&gt;53 equal&lt;/a&gt;. With the 11-limit consonance set {7, 8, 9, 10, 12, 14, 15, 17, 19, 22, 24, 26, 27, 29, 31, 34, 36, 38, 39, 41, 43, 44, 45, 46} it defines a graph of 31 edges with an automorphism group of order 96. The group consists of an &lt;a class="wiki_link_ext" href="http://mathworld.wolfram.com/OctahedralGroup.html" rel="nofollow"&gt;octahedronal group&lt;/a&gt; part which is transitive on the six notes from 2 to 7, that is {12, 17, 24, 29, 36, 41} of 53edo, generated by (2,3), (4,5),(6,7), (2,4)(3,5) and (4,6)(5,7), and an involution exchanging notes 1 and 8, that is, 5 and 48 of 53edo. The center of the MOS, note 0 in this numbering, stays where it is, and has degree six whereas all the other notes are degree seven.&lt;br /&gt;

&lt;!-- ws:start:WikiTextLocalImageRule:55:&amp;lt;img src=&amp;quot;/file/view/orwell9.png/359811159/orwell9.png&amp;quot; alt=&amp;quot;&amp;quot; title=&amp;quot;&amp;quot; /&amp;gt; --&gt;&lt;img src="/file/view/orwell9.png/359811159/orwell9.png" alt="orwell9.png" title="orwell9.png" /&gt;&lt;!-- ws:end:WikiTextLocalImageRule:55 --&gt;&lt;br /&gt;

The standard 2)5 dekany is a &lt;a class="wiki_link" href="/Combination%20product%20sets"&gt;combination product set&lt;/a&gt;, Cps([2,3,5,7,11], 2). It consists of ten notes associated to two-element subset of the set of the first five primes, {2,3,5,7,11}, and in one mode is 1-12/11-5/4-14/11-15/11-3/2-35/22-7/4-20/11-21/11, which we will take as its notes from note 0 to note 9. It has 30 edges, with connectivities 5 ≤ 6 ≤ 6, and the largest element of the Laplace spectrum is 8, so that the complementary graph is also connected. Its radius and diameter are both 2. The graph is known as the &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Johnson_graph" rel="nofollow"&gt;Johnson graph&lt;/a&gt; J(5,2). The 3)5 dekany, which is the inverse of the standard dekany, has the Johnson graph J(5,3) as its graph, which is graph-isomorphic to J(5,2).&lt;br /&gt;

The Ellis duodene is the 12-note 5-limit scale 1-16/15-9/8-6/5-5/4-4/3-45/32-3/2-8/5-5/3-9/5-15/8-2, and marvel tempering it leads to &lt;a class="wiki_link" href="/The%20Marveldene"&gt;marveldene&lt;/a&gt;. An excellent tuning for marvel is &lt;a class="wiki_link" href="/166edo"&gt;166et&lt;/a&gt;, and in that the scale becomes 0, 16, 28, 44, 53, 69, 81, 97, 113, 122, 141, 150, 166. If we use the 15-limit consonance set, {16, 18, 19, 21, 23, 25, 28, 32, 34, 37, 40, 44, 48, 50, 53, 58, 60, 63, 69, 74, 76, 78, 81, 85, 88, 90, 92, 97, 103, 106, 108, 113, 116, 118, 122, 126, 129, 132, 134, 138, 141, 143, 145, 147, 148, 150}, we obtain a graph with 55 edges and an automorphism group of order 32. Abstractly, the automorphism group is the direct product of the group of the square with the Klein 4-group; as a permutation group it is the square (dihedral group D8 of order 8) part, generated by {(1,2)(5,6)(8,11)(9,10), (1,5), (2,6)}, and the two involutions flipping two notes, (3,4) flipping Eb and E, and (7,12) flipping C and G.&lt;br /&gt;

The connectivites of the marveldene go 6.222 ≤ 7 ≤ 8, and it has a radius of 1 and a diameter of 2, with center {0, 7}, ie C and G. The largest element of the Laplace spectrum is 12, so the complementary graph is not connected. It has eight maximum cliques, the septads [0, 1, 3, 5, 7, 8, 11], [0, 1, 3, 5, 7, 9, 11], [0, 1, 4, 5, 7, 8, 11], [0, 1, 4, 5, 7, 9, 11], [0, 2, 3, 6, 7, 8, 10], [0, 2, 3, 6, 7, 8, 11], [0, 2, 4, 6, 7, 8, 10] and [0, 2, 4, 6, 7, 8, 11], and two maximal pentads, [0, 3, 7, 9, 10] and [0, 4, 7, 9, 10].&lt;br /&gt;

&lt;!-- ws:start:WikiTextHeadingRule:28:&amp;lt;h2&amp;gt; --&gt;&lt;h2 id="toc14"&gt;&lt;a name="Examples-Magic[13]"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:28 --&gt;Magic[13]&lt;/h2&gt;

Magic[13] is the 13-note MOS of &lt;a class="wiki_link" href="/Magic%20family#Magic-11-limit"&gt;magic temperament&lt;/a&gt;, which in &lt;a class="wiki_link" href="/104edo"&gt;104et&lt;/a&gt; has notes 0, 5, 10, 28, 33, 38, 43, 61, 66, 71, 76, 94, 99, 104. Using the 11-limit diamond, {13, 15, 15, 18, 20, 23, 28, 30, 33, 36, 38, 43, 48, 51, 53, 56, 61, 66, 68, 71, 74, 76, 81, 84, 86, 89, 89, 91} as the consonance set, we obtain a graph on 13 notes with 61 edges representing dyads. It has algebraic, vertex and edge connectivities all 8, and a disconnected graph complement. The radius and diameter are both 2.&lt;br /&gt;

&lt;!-- ws:start:WikiTextHeadingRule:30:&amp;lt;h2&amp;gt; --&gt;&lt;h2 id="toc15"&gt;&lt;a name="Examples-Orwell[13]"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:30 --&gt;Orwell[13]&lt;/h2&gt;

Orwell[13], the 13-note MOS of orwell, has four more notes but the same set of 11-limit consonances as Orwell[9]. Now we have 0, 5, 7, 12, 17, 19, 24, 29, 34, 36, 41, 46, 48, 53, and while the graph of the scale still has a lot of symmetry, it is of an entirely different kind. This time the symmetry group is analogous to that of the diatonic scale, being the dihedral group D26 on 13 points; as with the 7-limit diatonic scale, the symmetries of Orwell[13] appear as inversion and the ability to transpose to any key while retaining the dyadic character of all dyadic chords, which however are much more numerous in kind and number. In particular, Orwell[13] has 26 maximal pentads and 13 maximal hexads on which the automorphism group faithfully acts.&lt;br /&gt;

The graph of Orwell[13] is 10-regular, has 65 edges, with connectivities 9.058 ≤ 10 ≤ 10, and radius and diameter both 2.&lt;/body&gt;&lt;/html&gt;</pre></div>