Geodesic
Self-Complementary Generalized Orbits of a Permutation Group
Canadian mathematical bulletin, Tome 17 (1974) no. 2, pp. 203-208

Voir la notice de l'article provenant de la source Cambridge University Press

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. 
Frucht, Roberto; Harary, Frank. Self-Complementary Generalized Orbits of a Permutation Group. Canadian mathematical bulletin, Tome 17 (1974) no. 2, pp. 203-208. doi: 10.4153/CMB-1974-041-6
@article{10_4153_CMB_1974_041_6,
     author = {Frucht, Roberto and Harary, Frank},
     title = {Self-Complementary {Generalized} {Orbits} of a {Permutation} {Group}},
     journal = {Canadian mathematical bulletin},
     pages = {203--208},
     year = {1974},
     volume = {17},
     number = {2},
     doi = {10.4153/CMB-1974-041-6},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1974-041-6/}
}
TY  - JOUR
AU  - Frucht, Roberto
AU  - Harary, Frank
TI  - Self-Complementary Generalized Orbits of a Permutation Group
JO  - Canadian mathematical bulletin
PY  - 1974
SP  - 203
EP  - 208
VL  - 17
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1974-041-6/
DO  - 10.4153/CMB-1974-041-6
ID  - 10_4153_CMB_1974_041_6
ER  - 
%0 Journal Article
%A Frucht, Roberto
%A Harary, Frank
%T Self-Complementary Generalized Orbits of a Permutation Group
%J Canadian mathematical bulletin
%D 1974
%P 203-208
%V 17
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1974-041-6/
%R 10.4153/CMB-1974-041-6
%F 10_4153_CMB_1974_041_6

[1] 1. Harary, F., The number of linear, directed, rooted, and connected graphs. Trans. Amer. Math. Soc. 78 (1955) 445-463. Google Scholar

[2] 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] 3. Harary, F., Graph Theory, Addison-Wesley, Reading, Mass., 1969. Google Scholar

[4] 4. Harary, F. and Palmer, E. M., The power group enumeration theorem. J. Combinatorial Theory 1 (1966) 157-173. Google Scholar

[5] 5. Harary, F. and Palmer, E. M., Enumeration of self-converse diraphs. Mathematika 13 (1966) 151-157. Google Scholar

[6] 6. Harary, F. and Palmer, E. M., Graphical Enumeration. Academic Press, New York, 1973. Google Scholar

[7] 7. Pόlya, G., Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math. 68 (1937) 145-254. Google Scholar

[8] 8. Read, R. C., On the number of self complementary graphs and digraphs. J. London Math. Soc. 38 (1963) 99-104. Google Scholar

[9] 9. Ringel, G., Selbstkomplementare Graphen. Arch. Math. 14 (1963) 354-358. Google Scholar

[10] 10. Sachs, H., Uber selbstkomplementare Graphen. Publ. Math. Debrecen 9 (1962) 270-288. Google Scholar

Cité par Sources :