A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of requirements for the degree of Master of Science. December 2014. / Let G be a finite group and let r ∈ N. A coloring of G is any mapping
: G −→ {1, 2, 3, ..., r}. Colorings of G, and are equivalent if there exists an
element g in G such that (xg−1) = (x) for all x in G. A coloring of a finite group
G is called symmetric with respect to an element g in G if (gx−1g) = (x) for all
x ∈ G. We derive formulae for computing the number of symmetric colorings and the
number of equivalence classes of symmetric colorings for some classes of finite groups
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:wits/oai:wiredspace.wits.ac.za:10539/17640 |
| Date | 06 May 2015 |
| Creators | Phakathi, Jabulani |
| Source Sets | South African National ETD Portal |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | application/pdf |
Page generated in 0.0018 seconds