Change search
ReferencesLink to record
Permanent link

Direct link
Independence Complexes of Certain Families of Graphs
KTH, School of Computer Science and Communication (CSC). KTH, School of Engineering Sciences (SCI), Mathematics (Dept.).
2011 (English)Student thesis
Abstract [en]

The focus of this report will be on independence complexes constructed from independent sets of members of sequences graphs. For such independence complexes, we will study generating functions and closed formulae for the Euler characteristics and f-polynomials, as well as homology groups of different degrees. All of these can be computed by hand, although this quickly becomes tedious as well as really difficult to do, hence recursive methods will be used instead. the generating functions, bounded formulae and recursive equations will be compared to known number sequences, and where possible bijections to other problems will be establised. For the independence complexes of each graphs sequence, formulae will be given for where the homology groups are nonzero, as well as in some cases formulae for the exact dimensions of the homology groups for each complex. 

Place, publisher, year, edition, pages
National Category
Computational Mathematics
URN: urn:nbn:se:kth:diva-38265OAI: diva2:436476
Physics, Chemistry, Mathematics
Available from: 2012-09-14 Created: 2011-08-23 Last updated: 2012-09-18Bibliographically approved

Open Access in DiVA

fulltext(238 kB)369 downloads
File information
File name FULLTEXT01.pdfFile size 238 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)Mathematics (Dept.)
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 369 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 48 hits
ReferencesLink to record
Permanent link

Direct link