Difference between revisions of "MCSN Thursday, 15-Sep-11"
| Line 1: | Line 1: | ||
| − | * More | + | * More precipitation from your [[Brainstorming MCSN | brainstorms]] |
| − | * Homework | + | * Homework exercises from Tuesday - review |
* How to create networks, partitions, and vectors in Pajek | * How to create networks, partitions, and vectors in Pajek | ||
** Manipulating networks in Pajek itself | ** Manipulating networks in Pajek itself | ||
Revision as of 23:02, 14 September 2011
- More precipitation from your brainstorms
- Homework exercises from Tuesday - review
- How to create networks, partitions, and vectors in Pajek
- Manipulating networks in Pajek itself
- Editing Pajek files in a text processor
- Edge and arc list formats
- Matrix format
- Using txt2pajek
- More combinatorics...
- How many lines does a complete simple graph on n vertices contain?
- Undirected graphs
- Directed graphs
- How many different undirected simple graphs are there on n vertices?
- How many lines does a complete simple graph on n vertices contain?
