@article{MZM_2022_111_3_a5,
author = {N. A. Kuz'min and D. S. Malyshev},
title = {Enumeration of {Matchings} in {Complete} $q$-ary {Trees}},
journal = {Matemati\v{c}eskie zametki},
pages = {393--402},
year = {2022},
volume = {111},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2022_111_3_a5/}
}
N. A. Kuz'min; D. S. Malyshev. Enumeration of Matchings in Complete $q$-ary Trees. Matematičeskie zametki, Tome 111 (2022) no. 3, pp. 393-402. http://geodesic.mathdoc.fr/item/MZM_2022_111_3_a5/
[1] A. D. Korshunov, A. A. Sapozhenko, “O chisle dvoichnykh kodov s rasstoyaniem 2”, Problemy kibernetiki, 40 (1983), 111–130 | MR | Zbl
[2] N. J. Kalkin, H. S. Wilf, “The number of independent sets in a grid graph”, SIAM J. Discrete Math., 11:1 (1997), 54–60 | DOI | MR
[3] P. Kirschenhofer, H. Prodinger, R. Tichy, “Fibonacci numbers of graphs II”, Fibonacci Quart., 21:3 (1983), 219–229 | MR | Zbl
[4] A. B. Dainyak, “O chisle nezavisimykh mnozhestv v polnykh $q$-arnykh derevyakh”, Uch. zap. Kazanskogo gos. un-ta. Ser. fiz.-matem. nauki, 151:2 (2009), 59–64 | Zbl
[5] D. S. Taletskii, D. S. Malyshev, “O kolichestve maksimalnykh nezavisimykh mnozhestv v polnykh $q$-arnykh derevyakh”, Diskret. matem., 28:4 (2016), 139–149 | DOI | MR
[6] D. S. Taletskii, “O svoistvakh resheniya rekurrentnogo uravneniya, perechislyayuschego maksimalnye nezavisimye mnozhestva v polnykh derevyakh”, Zhurnal SVMO, 20:1 (2018), 46–54 | DOI | Zbl
[7] P. W. Kasteleyn, “The statistics of dimers on a lattice”, Physica, 27:12 (1961), 1209–1225 | DOI | Zbl