Abstract
An algorithm, based on a weighted form of Burnside's lemma, is presented for the enumeration of isographs and oriented isographs. In the two-stage algorithm, the contributions to the sum of weights from different cycles and cycle pairs of the underlying group are first listed and then ‘multiplied’ by a stagewise process. The elimination of the unwanted graphs in the different stages ensures that the computations are kept to the minimum. Particular results obtained include self-converse and self-complementary isographs and oriented isographs. Eulerian digraphs, etc. are then obtained by applying the Möbius inversion formula.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
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.
