Voir la notice de l'article provenant de la source Cambridge University Press
Sridharan, M. R. Note on an Asymptotic Formula for a Class of Digraphs. Canadian mathematical bulletin, Tome 21 (1978) no. 3, pp. 377-381. doi: 10.4153/CMB-1978-068-1
@article{10_4153_CMB_1978_068_1,
author = {Sridharan, M. R.},
title = {Note on an {Asymptotic} {Formula} for a {Class} of {Digraphs}},
journal = {Canadian mathematical bulletin},
pages = {377--381},
year = {1978},
volume = {21},
number = {3},
doi = {10.4153/CMB-1978-068-1},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-068-1/}
}
[1] 1. Harary, F. and Palmer, E. M., Graphical Enumeration, Academic Press, N.Y., (1973). Google Scholar
[2] 2. Oberschelp, W., Kombinatorische Anzahlbestimmungen in Relationen, Math. Ann. 174 (1967), 53-78. Google Scholar
[3] 3. Palmer, E. M., Asymptotic formulas for the number of self-complementary graphs and digraphs, Mathematika 17 (1970), 85-90. Google Scholar
[4] 4. Read, R. C., On the number of self-complementary graphs and digraphs, J. Lond. Math. Soc. 38 (1963), 99-104. Google Scholar
[5] 5. Sridharan, M. R., Self-complementary and self-converse oriented graphs, Indag. Math. 32 (1970), 441-447. Google Scholar
Cité par Sources :