Weakly Cospectral Graphs
Matematičeskie zametki, Tome 75 (2004) no. 4, pp. 614-623
Cet article a éte moissonné depuis la source Math-Net.Ru
It is proved that any set of finite pairwise nonisomorphic weakly cospectral connected pseudographs, as well as any set of pseudodigraphs satisfying various additional conditions, is finite.
@article{MZM_2004_75_4_a10,
author = {S. P. Strunkov},
title = {Weakly {Cospectral} {Graphs}},
journal = {Matemati\v{c}eskie zametki},
pages = {614--623},
year = {2004},
volume = {75},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2004_75_4_a10/}
}
S. P. Strunkov. Weakly Cospectral Graphs. Matematičeskie zametki, Tome 75 (2004) no. 4, pp. 614-623. http://geodesic.mathdoc.fr/item/MZM_2004_75_4_a10/
[1] Tsvetkovich D., Dub M., Zakhs Kh., Spektry grafov. Teoriya i primenenie, Naukova dumka, Kiev, 1984
[2] Kostrikin A. I., Vokrug Bernsaida, Nauka, M., 1986
[3] Kharari F., Teoriya grafov, Mir, M., 1973
[4] Cvetković D. M., “Cubic integral graphs”, Univ. Beograd Publ. Elektrotehn. Fak., Ser. Mat. Fiz., 1975, no. 498–541, 107–113 | MR | Zbl
[5] Gantmakher F. R., Teoriya matrits, Nauka, M., 1966
[6] Markus M., Mink Kh., Obzor po teorii matrits i matrichnykh neravenstv, Nauka, M., 1972
[7] Strunkov S. P., “Ob odnoi teoreme Tsvetkovicha v teorii grafov”, UMN, 45:6 (1990), 145–146 | MR | Zbl
[8] Strunkov S. P., “O slabo kospektralnykh grafakh”, Dokl. RAN, 379:3 (2001), 302–304 | MR | Zbl