Enumeration of Hamiltonian Cycles on a CompleteGraph using ECO method
عنوان مقاله: Enumeration of Hamiltonian Cycles on a CompleteGraph using ECO method
شناسه ملی مقاله: JR_ACSIJ-3-5_004
منتشر شده در شماره 5 دوره 3 فصل September در سال 1393
شناسه ملی مقاله: JR_ACSIJ-3-5_004
منتشر شده در شماره 5 دوره 3 فصل September در سال 1393
مشخصات نویسندگان مقاله:
Retno Maharesi - Department of Information Technology, Gunadarma University, West Java, Indonesia
خلاصه مقاله:
Retno Maharesi - Department of Information Technology, Gunadarma University, West Java, Indonesia
A class of combinatorial objects, namely Hamiltoniancycles in a complete graph of n nodes is constructed basedon ECO method. Here, a Hamiltonian cycle is representedas a permutation cycle of length n whose permutation andits corresponding inverse permutation are notdistinguished. Later, this construction is translated into asuccession rule. The generating function of Hamiltoniancycles enumerated in a complete graph of size n will bedetermined through the use of ordinary generatingfunction of its permutation class and the exponentialgenerating function of the infinite sequences of 1 s.
کلمات کلیدی: numeration, Hamiltonian cycle,c omplete graph, generating function
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/308913/