Enumeration of Hamiltonian Cycles on a CompleteGraph using ECO method
Publish Year: 1393
نوع سند: مقاله ژورنالی
زبان: English
View: 595
This Paper With 5 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_ACSIJ-3-5_004
تاریخ نمایه سازی: 12 آبان 1393
Abstract:
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.
Keywords:
Authors
Retno Maharesi
Department of Information Technology, Gunadarma University, West Java, Indonesia