Essays about: "Non-isomorphic graph."
Found 1 essay containing the words Non-isomorphic graph..
-
1. Polya's Enumeration Theorem : Number of colorings of n-gons and non isomorphic graphs,
University essay from Institutionen för datavetenskap, fysik och matematik, DFMAbstract : 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. READ MORE
Result pages:
1