Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2001_13_4_a8, author = {V. A. Kolmykov}, title = {On summation over paths in spectral graph theory}, journal = {Diskretnaya Matematika}, pages = {122--125}, publisher = {mathdoc}, volume = {13}, number = {4}, year = {2001}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DM_2001_13_4_a8/} }
V. A. Kolmykov. On summation over paths in spectral graph theory. Diskretnaya Matematika, Tome 13 (2001) no. 4, pp. 122-125. http://geodesic.mathdoc.fr/item/DM_2001_13_4_a8/
[1] Tsvetkovich D., Dub M., Zakhs Kh., Spektry grafov. Teoriya i primenenie, Naukova Dumka, Kiev, 1984 | MR
[2] Schwenk A. J., “Computing the characteristic polynomial of a graph”, Lect. Notes Math., 406, 1974, 153–172 | MR | Zbl
[3] Sumin M. V., O spektralnom metode nakhozhdeniya rasstoyaniya mezhdu vershinami dlya nekotorykh klassov grafov, Voronezh. gos. un-t., Voronezh, 1985 | MR