Enumeration by e

Mehdi Hassani ()
Additional contact information
Mehdi Hassani: University of Zanjan

A chapter in Modern Discrete Mathematics and Analysis, 2018, pp 227-233 from Springer

Abstract: 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.

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-74325-7_10

Ordering information: This item can be ordered from
http://www.springer.com/9783319743257

DOI: 10.1007/978-3-319-74325-7_10

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().