Difference between revisions of "MCSN Tuesday, 13-Sep-11"
| Line 14: | Line 14: | ||
*** tree (only one path between each pair of vertices) | *** tree (only one path between each pair of vertices) | ||
*** planar graph | *** planar graph | ||
| − | + | ** isomorphic graphs | |
| − | ** | + | ** combinatorics: counting graphs |
| − | ** combinatorics | ||
** Wilson ch.1 questions | ** Wilson ch.1 questions | ||
| − | * ESNAP | + | * ESNAP readings |
Revision as of 22:15, 10 September 2011
- Pajek installations ok?
- Applications of SNA to music culture
- Graph theory
- basic concepts, reviewing 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
- basic concepts, reviewing Wilson ch.1
- ESNAP readings
