Geodesic
Asymmetric and symmetric graphs
Glasgow mathematical journal, Tome 15 (1974) no. 1, pp. 69-73

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

An (n, q) graph consists of n nodes and q edges, i.e. q distinct unordered pairs of different nodes, so that there are no loops or multiple edges. We write T for the number of unlabelled (n, q) graphs and F for the number of labelled (n, q) graphs. We say that a labelled graph is symmetric if there is a nonidentical permutation of its nodes which leaves the graph unaltered. We write r for the order of the automorphism group of the graph, i.e. the group of all those permutations of the nodes which leave the graph unaltered; we say that the graph is of symmetry order r. A graph which is not symmetric is called asymmetric and, for such a graph, obviously r = 1. We say that an unlabelled graph is symmetric or asymmetric according as the graph obtained by labelling its nodes is symmetric or asymmetric. 
Wright, E. M. Asymmetric and symmetric graphs. Glasgow mathematical journal, Tome 15 (1974) no. 1, pp. 69-73. doi: 10.1017/S0017089500002159
@article{10_1017_S0017089500002159,
     author = {Wright, E. M.},
     title = {Asymmetric and symmetric graphs},
     journal = {Glasgow mathematical journal},
     pages = {69--73},
     year = {1974},
     volume = {15},
     number = {1},
     doi = {10.1017/S0017089500002159},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500002159/}
}
TY  - JOUR
AU  - Wright, E. M.
TI  - Asymmetric and symmetric graphs
JO  - Glasgow mathematical journal
PY  - 1974
SP  - 69
EP  - 73
VL  - 15
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089500002159/
DO  - 10.1017/S0017089500002159
ID  - 10_1017_S0017089500002159
ER  - 
%0 Journal Article
%A Wright, E. M.
%T Asymmetric and symmetric graphs
%J Glasgow mathematical journal
%D 1974
%P 69-73
%V 15
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089500002159/
%R 10.1017/S0017089500002159
%F 10_1017_S0017089500002159

[1] 1.Erdös, P. and Renyi, A., Asymmetric graphs, Acta Math. Acad. Sci. Hungar. 14 (1963), 295–315, especially 298. Google Scholar | DOI

[2] 2.Erdös, P. and Renyi, A., On random graphs I, Publ. Math. Debrecen 6 (1959), 290–297. Google Scholar

[3] 3.Euler, L., Solutio questionis curiosae ex doctrina combinationum, Mem. Acad. Sci. St. Petersbourg 3 (1811), 57–64; Opera omnia (1) 7 (1923), 435–448. Google Scholar

[4] 4.Polya, G., Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und Chemische Verbindungen, Acta Math. 68 (1937), 145–254. Google Scholar | DOI

[5] 5.Riordan, J., An introduction to combinatorial analysis (New York, 1958), 57–62. Google Scholar

[6] 6.Wright, E. M., Graphs on unlabelled nodes with a given number of edges, Acta Math. 126 (1971), 1–9. Google Scholar | DOI

[7] 7.Wright, E. M., The number of unlabelled graphs with many nodes and edges, Bull. Amer. Math. Soc. 78 (1972), 1032–1034. Google Scholar | DOI

Cité par Sources :