Hahn distance: Difference between revisions

Line 1:

In {{w|Graph (mathematics)|graph theory}}, the {{w|Distance (graph theory)|distance}} between two vertices a and b is defined as the minimum number of edges in a path connecting them, or in other words the minimum length of a connecting path; if there is no path connection them, the distance is regarded as infinite. Given a set of [[just interval]]s, or more usually, of [[pitch class|classes of octave-equivalent intervals]], we can define a corresponding graph whose vertices are the intervals and which contain an edge between two intervals if the ratio between them is a [[consonance]]. Normally the [[unison]] is not counted as a consonance, and we therefore obtain in this way a graph with no loops which is very useful in various ways, such as in the study of scales.

Revision as of 16:18, 17 February 2025 view source Lériendil (talk \| contribs) 8,044 edits deploying new cat ← Older edit		Revision as of 16:46, 17 February 2025 view source Lériendil (talk \| contribs) 8,044 edits mNo edit summary Newer edit →
Line 1:		Line 1:
	{{Legacy~~\|Hahn_distance~~}}		{{Legacy}}
	In {{w\|Graph (mathematics)\|graph theory}}, the {{w\|Distance (graph theory)\|distance}} between two vertices a and b is defined as the minimum number of edges in a path connecting them, or in other words the minimum length of a connecting path; if there is no path connection them, the distance is regarded as infinite. Given a set of [[just interval]]s, or more usually, of [[pitch class\|classes of octave-equivalent intervals]], we can define a corresponding graph whose vertices are the intervals and which contain an edge between two intervals if the ratio between them is a [[consonance]]. Normally the [[unison]] is not counted as a consonance, and we therefore obtain in this way a graph with no loops which is very useful in various ways, such as in the study of scales.		In {{w\|Graph (mathematics)\|graph theory}}, the {{w\|Distance (graph theory)\|distance}} between two vertices a and b is defined as the minimum number of edges in a path connecting them, or in other words the minimum length of a connecting path; if there is no path connection them, the distance is regarded as infinite. Given a set of [[just interval]]s, or more usually, of [[pitch class\|classes of octave-equivalent intervals]], we can define a corresponding graph whose vertices are the intervals and which contain an edge between two intervals if the ratio between them is a [[consonance]]. Normally the [[unison]] is not counted as a consonance, and we therefore obtain in this way a graph with no loops which is very useful in various ways, such as in the study of scales.