On the enumeration of connected graphs with specified biconnected components

Description:  We derive a recurrence for the number of connected graphs whose biconnected components are all graphs on the same vertex and edge numbers. The proof uses Abel's binomial theorem and generalizes Dziobek's induction proof of Cayley's formula. Date:  2012-03-14 Start Time:   15:00 Speaker:  Ângela Mestre (CELC) Institution:  - Place:  Room 5.5 Research Groups: -Algebra and Combinatorics See more:   <Main>