Counting Graphs (By Number Of Cutpoints)
Prof. Stanley Selkow
WPI Computer Science Department
Friday, March 7, 1997
11 a.m. - 12 noon
Fuller Labs 320
The problems of counting labeled and unlabeled graphs will be introduced. Schemes will be developed for counting labeled connected graphs and blocks. Asymptotic approximations of these functions will be described (including a simple technique from probabilistic combinatorics). Finally, an overview will be given of a new result for enumerating connected labeled graphs by number of cutpoints, along with an asymptotic estimate of these numbers
. Maintained by webmaster@wpi.eduLast modified: Sep 27, 2006, 16:05 EDT
![[WPI]](http://www.wpi.edu/Buttons/seal.gif "WPI Homepage"){kind=small}
![[Home]](http://www.wpi.edu/Buttons/home.gif){kind=small}
![[Back]](http://www.wpi.edu/Buttons/back.gif){kind=small}
![[Top]](http://www.wpi.edu/Buttons/top.gif){kind=small}