Abstract
We establish some results about orbit closures of permutation groups and their relationship to the automorphism groups of power-set graphs with colorings. One of our theorems proves that an arbitrary group can be realized as the automorphism group of a colored power-set graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.