Geodesic
On the Number of Independent Sets in Perfect $q$-ary Trees
Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Kazanskii Gosudarstvennyi Universitet. Uchenye Zapiski. Seriya Fiziko-Matematichaskie Nauki, Tome 151 (2009) no. 2, pp. 59-64
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

Asymptotic representation is obtained for the number of vertex independent sets in perfect $q$-ary trees for every fixed $q$.
Keywords: independent set, trees, asymptotic bounds. 
@article{UZKU_2009_151_2_a6,
     author = {A. B. Dainiak},
     title = {On the {Number} of {Independent} {Sets} in {Perfect} $q$-ary {Trees}},
     journal = {U\v{c}\"enye zapiski Kazanskogo universiteta. Seri\^a Fiziko-matemati\v{c}eskie nauki},
     pages = {59--64},
     year = {2009},
     volume = {151},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/UZKU_2009_151_2_a6/}
}
TY  - JOUR
AU  - A. B. Dainiak
TI  - On the Number of Independent Sets in Perfect $q$-ary Trees
JO  - Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki
PY  - 2009
SP  - 59
EP  - 64
VL  - 151
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/UZKU_2009_151_2_a6/
LA  - ru
ID  - UZKU_2009_151_2_a6
ER  - 
%0 Journal Article
%A A. B. Dainiak
%T On the Number of Independent Sets in Perfect $q$-ary Trees
%J Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki
%D 2009
%P 59-64
%V 151
%N 2
%U http://geodesic.mathdoc.fr/item/UZKU_2009_151_2_a6/
%G ru
%F UZKU_2009_151_2_a6
A. B. Dainiak. On the Number of Independent Sets in Perfect $q$-ary Trees. Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Kazanskii Gosudarstvennyi Universitet. Uchenye Zapiski. Seriya Fiziko-Matematichaskie Nauki, Tome 151 (2009) no. 2, pp. 59-64. http://geodesic.mathdoc.fr/item/UZKU_2009_151_2_a6/

[1] Korshunov A. D., Sapozhenko A. A., “O chisle dvoichnykh kodov s rasstoyaniem 2”, Problemy kibernetiki, 40, Nauka, M., 1983, 111–130 | MR

[2] Calkin N., Wilf H. S., “The number of independent sets in a grid graph”, SIAM J. Discr. Math., 11 (1998), 54–60 | DOI | MR | Zbl

[3] Teufl E., Wagner S., “Enumeration problems for classes of self-similar graphs”, J. Combinatorial Theory Ser. A, 114:7 (2007), 1254–1277 | DOI | MR | Zbl

[4] Knopfmacher A., Tichy R. F., Wagner S., Ziegler V., “Graphs, Partitions and Fibonacci Numbers”, Discrete Applied Mathematics, 155:10 (2007), 1175–1187 | DOI | MR | Zbl

[5] Voronin V. P., Demakova E. V., “O chisle nezavisimykh mnozhestv dlya nekotorykh semeistv grafov”, Trudy IV Mezhdunar. konf. “Diskretnye modeli v teorii upravlyayuschikh sistem” (Krasnovidovo, 19–25 iyunya 2000 g.), MAKS Press, M., 145–149

[6] Prasolov V. V., Mnogochleny, MTsNMO, M., 2003, 336 pp.