Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-05T22:36:23.269Z Has data issue: false hasContentIssue false
  • English
  • Français

Note on an Asymptotic Formula for a Class of Digraphs

Published online by Cambridge University Press:  20 November 2018

M. R. Sridharan
M. R. Sridharan*
Affiliation:
Department of Mathematics, Indian Institute of Technology, Kanpur, India, 208016
Rights & Permissions [Opens in a new window]

Extract

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.

Self-complementary digraphs, and oriented type of these were counted by Read [4] and Sridharan [5] respectively. In [3] Palmer obtained an asymptotic formula for the number of self-complementary digraphs following a method of Oberschelp [2]. An asymptotic formula for the number of self-complementary oriented graphs is given here. We refer to [1] for definitions and details not mentioned here.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 21 , Issue 3 , 01 September 1978 , pp. 377 - 381
Copyright
Copyright © Canadian Mathematical Society 1978

References

1. Harary, F. and Palmer, E. M., Graphical Enumeration, Academic Press, N.Y., (1973).Google Scholar
2. Oberschelp, W., Kombinatorische Anzahlbestimmungen in Relationen, Math. Ann. 174 (1967), 53-78.Google Scholar
3. Palmer, E. M., Asymptotic formulas for the number of self-complementary graphs and digraphs, Mathematika 17 (1970), 85-90.Google Scholar
4. Read, R. C., On the number of self-complementary graphs and digraphs, J. Lond. Math. Soc. 38 (1963), 99-104.Google Scholar
5. Sridharan, M. R., Self-complementary and self-converse oriented graphs, Indag. Math. 32 (1970), 441-447.Google Scholar