On weakly cospectral graphs
Matematičeskie zametki, Tome 80 (2006) no. 4, pp. 627-629
Cet article a éte moissonné depuis la source Math-Net.Ru
We prove that any set of pair-wise nonisomorphic strongly connected weakly cospectral pseudodigraphs whose set of nilpotency indices is finite also is finite.
@article{MZM_2006_80_4_a15,
author = {S. P. Strunkov},
title = {On weakly cospectral graphs},
journal = {Matemati\v{c}eskie zametki},
pages = {627--629},
year = {2006},
volume = {80},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2006_80_4_a15/}
}
S. P. Strunkov. On weakly cospectral graphs. Matematičeskie zametki, Tome 80 (2006) no. 4, pp. 627-629. http://geodesic.mathdoc.fr/item/MZM_2006_80_4_a15/
[1] Kharari F., Teoriya grafov, Mir, M., 1973 | MR
[2] Strunkov S. P., “O slabo kospektralnykh grafakh”, Dokl. RAN, 379:3 (2001), 302–304 | MR | Zbl
[3] Strunkov S. P., “O slabo kospektralnykh grafakh”, Matem. zametki, 75:4 (2004), 614–623 | MR | Zbl
[4] Markus M., Mink Kh., Obzor po teorii matrits i matrichnykh neravenstv, Nauka, M., 1972 | MR
[5] Gantmakher F. R., Teoriya matrits, Nauka, M., 1966 | MR | Zbl