Difference between revisions of "MCSN Tuesday, 13-Sep-11"
| Line 1: | Line 1: | ||
| − | * Pajek installations ok? | + | = Course mechanics = |
| − | + | ||
| − | * Graph theory | + | * Any questions on the [[Music culture as a social network (Fall 2011)| outline]]? |
| − | + | * Any questions on the [https://eclass.srv.ualberta.ca/my/ Moodle]? | |
| − | + | ||
| − | + | = Pajek = | |
| − | + | * installations ok? | |
| − | + | ||
| − | + | = Applications of SNA to music culture = | |
| − | + | ||
| − | + | * [[Brainstorming MCSN]] | |
| − | + | * [[Research on music networks]] | |
| − | + | ||
| − | + | = Graph theory (Wilson ch. 1) = | |
| − | + | ||
| − | + | * vertex | |
| − | + | * edge,arc | |
| − | + | * degree | |
| − | + | * graph, digraph | |
| + | * multiple edges, loops | ||
| + | * simple graph | ||
| + | * walk, path | ||
| + | * Eulerian (edge) and Hamiltonian (vertex) graphs | ||
| + | * connected and disconnected graphs | ||
| + | * tree (only one path between each pair of vertices) | ||
| + | * planar graph | ||
| + | isomorphic graphs | ||
| + | combinatorics: counting graphs | ||
| + | Wilson ch.1 questions | ||
| + | |||
| + | |||
| + | |||
| + | = ESNAP reading = | ||
Revision as of 19:08, 12 September 2011
Contents
Course mechanics
Pajek
- installations ok?
Applications of SNA to music culture
Graph theory (Wilson ch. 1)
- vertex
- edge,arc
- degree
- graph, digraph
- multiple edges, loops
- simple graph
- walk, path
- Eulerian (edge) and Hamiltonian (vertex) graphs
- connected and disconnected graphs
- tree (only one path between each pair of vertices)
- planar graph
isomorphic graphs combinatorics: counting graphs Wilson ch.1 questions
