Talk:Graph-theoretic properties of scales/WikispacesArchive

From Xenharmonic Wiki
Jump to: navigation, search


All discussion below is archived from the Wikispaces export in its original unaltered form.
Please do not add any new discussion to this archive page.
All new discussion should go on Talk:Graph-theoretic properties of scales.


"A clique in a graph is a subgraph such that there is an edge connecting every vertex."

Maybe I am understanding this incorrectly, but shouldn't this say that there is an edge connecting every *pair* of vertices?

- Sarzadoce September 20, 2012, 04:57:10 PM UTC-0700

You are correct.

- keenanpepper September 21, 2012, 09:42:20 AM UTC-0700