Hostname: page-component-74656f9884-g96k6 Total loading time: 0 Render date: 2026-11-10T00:19:23.965Z Has data issue: false hasContentIssue false
  • English
  • Français

Self-Complementary Generalized Orbits of a Permutation Group

Published online by Cambridge University Press:  20 November 2018

Roberto Frucht  and
Frank Harary
Roberto Frucht
Affiliation:
Untversidad Técnica Federico Santa Maria, Valparaiso, Chile
Frank Harary
Affiliation:
The University of Michigan, Ann Arbor, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A permutation group A of degree n acting on a set X has a certain number of orbits, each a subset of X. More generally, A also induces an equivalence relation on X(k) the set of all k subsets of X, and the resulting equivalence classes are called k orbits of A, or generalized orbits. A self-complementary k-orbit is one in which for every k-subset S in it, X—S is also in it. Our main results are two formulas for the number s(A) of self-complementary generalized orbits of an arbitrary permutation group A in terms of its cycle index. We show that self-complementary graphs, digraphs, and relations provide special classes of self-complementary generalized orbits.

Information

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 17 , Issue 2 , 01 June 1974 , pp. 203 - 208
Copyright
Copyright © Canadian Mathematical Society 1974

References

1. Harary, F., The number of linear, directed, rooted, and connected graphs. Trans. Amer. Math. Soc. 78 (1955) 445-463.Google Scholar
2. Harary, F., Applications of Pόlya’s theorem to permutation groups. A Seminar on Graph Theory (F. Harary, Ed.), Holt, Rinehart, and Winston, New York, 1967, 25-33.Google Scholar
3. Harary, F., Graph Theory, Addison-Wesley, Reading, Mass., 1969.Google Scholar
4. Harary, F. and Palmer, E. M., The power group enumeration theorem. J. Combinatorial Theory 1 (1966) 157-173.Google Scholar
5. Harary, F. and Palmer, E. M., Enumeration of self-converse diraphs. Mathematika 13 (1966) 151-157.Google Scholar
6. Harary, F. and Palmer, E. M., Graphical Enumeration. Academic Press, New York, 1973.Google Scholar
7. Pόlya, G., Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math. 68 (1937) 145-254.Google Scholar
8. Read, R. C., On the number of self complementary graphs and digraphs. J. London Math. Soc. 38 (1963) 99-104.Google Scholar
9. Ringel, G., Selbstkomplementare Graphen. Arch. Math. 14 (1963) 354-358.Google Scholar
10. Sachs, H., Uber selbstkomplementare Graphen. Publ. Math. Debrecen 9 (1962) 270-288.Google Scholar