<p>Polya’s theorem can be used to enumerate objects under permutation groups. Using grouptheory, combinatorics and some examples, Polya’s theorem and Burnside’s lemma arederived. The examples used are a square, pentagon, hexagon and heptagon under theirrespective dihedral groups. Generalization using more permutations and applications tograph theory.Using Polya’s Enumeration theorem, Harary and Palmer [5] give a function whichgives the number of unlabeled graphs n vertices and m edges. We present their work andthe necessary background knowledge.</p>
| Identifer | oai:union.ndltd.org:UPSALLA/oai:DiVA.org:lnu-6199 |
| Date | January 2010 |
| Creators | Badar, Muhammad, Iqbal, Ansir |
| Publisher | Linnaeus University, School of Computer Science, Physics and Mathematics, Linnaeus University, School of Computer Science, Physics and Mathematics |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, text |
Page generated in 0.0021 seconds