ENUMERATION OF LABELED AND UNLABELED HAMILTONIAN CYCLES IN COMPLETE k-PARTITE GRAPHS

摘要

Labeled and unlabeled Hamiltonian cycles in complete n-partite graphs Kd,d,...,d having exactly d vertices in each part are enumerated. Recurrence relations for the exact values bnddocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$ {b}_n^{(d)} $$end{document} of such cycles for arbitrary n and d are obtained.