Difference between revisions of "MCSN Thursday, 15-Sep-11"
| Line 1: | Line 1: | ||
* More on your brainstorms | * More on your brainstorms | ||
| − | * Homework exercise from Tuesday | + | * Homework exercise 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 | + | ** Manipulating networks in Pajek itself |
** Editing Pajek files in a text processor | ** Editing Pajek files in a text processor | ||
| + | *** Edge and arc list formats | ||
| + | *** Matrix format | ||
** Using [http://pajek.imfm.si/doku.php?id=faq:text2pajek txt2pajek] | ** Using [http://pajek.imfm.si/doku.php?id=faq:text2pajek txt2pajek] | ||
* More combinatorics... | * More combinatorics... | ||
| − | ** | + | ** How many lines does a complete simple graph on n vertices contain? |
*** Undirected graphs | *** Undirected graphs | ||
*** Directed graphs | *** Directed graphs | ||
| − | ** | + | ** How many different undirected simple graphs are there on n vertices? |
| − | *** [http://mapleta.maths.uwa.edu.au/~gordon/remote/graphs/index.html#nums numbers] | + | *** Here, "different" means "non-isomorphic". |
| − | *** [http://gfredericks.com/sandbox/graphs/browse pictures] | + | **** A square and a trapazoid and a twisted square are all isomorphic |
| + | **** Energizing graphs in Pajek always generates an isomorphic equivalent | ||
| + | *** Counting: | ||
| + | **** [http://mapleta.maths.uwa.edu.au/~gordon/remote/graphs/index.html#nums numbers] | ||
| + | **** [http://gfredericks.com/sandbox/graphs/browse pictures] | ||
Revision as of 22:59, 14 September 2011
- More on your brainstorms
- Homework exercise 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?
