Isographs and oriented isographs

Sridharan, M. R. ; Parthasarathy, K. R. (1972) Isographs and oriented isographs Journal of Combinatorial Theory, Series B, 13 (2). pp. 99-111. ISSN 0095-8956

Full text not available from this repository.

Official URL:

Related URL:


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.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:36230
Deposited On:25 May 2011 13:32
Last Modified:25 May 2011 13:32

Repository Staff Only: item control page