Abstract
We obtain some formulas, explicit bounds, and an asymptotic approximation for the number of all distinct paths between a specific pair of vertices in a complete graph on n vertices. Also, we give further enumerative formulas related to e, concerning the number derangements.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alzer, H.: On some inequalities for the gamma and psi functions. Math. Comput. 66, 373–389 (1997)
Hassani, M.: Cycles in graphs and derangements. Math. Gaz. 88, 123–126 (2004)
Hassani, M., Sofo, A.: Sharp bounds for the constant e. Vietnam J. Math. 43, 629–633 (2015)
Hassani, M.: Derangements and applications. J. Integer Seq. 6(1) (2003). Article 03.1.2
Odlyzko, A. M.: Asymptotic enumeration methods. In: Handbook of Combinatorics, vols. 1, 2, pp. 1063–1229. Elsevier, Amsterdam (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Hassani, M. (2018). Enumeration by e. In: Daras, N., Rassias, T. (eds) Modern Discrete Mathematics and Analysis . Springer Optimization and Its Applications, vol 131. Springer, Cham. https://doi.org/10.1007/978-3-319-74325-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-74325-7_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74324-0
Online ISBN: 978-3-319-74325-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)