RUS  ENG
Full version
JOURNALS // Matematicheskie Zametki // Archive

Mat. Zametki, 2004 Volume 75, Issue 4, Pages 614–623 (Mi mzm57)

This article is cited in 1 paper

Weakly Cospectral Graphs

S. P. Strunkov

Moscow Engineering Physics Institute (State University)

Abstract: 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.

UDC: 519.1

Received: 10.01.2003
Revised: 28.05.2003

DOI: 10.4213/mzm57


 English version:
Mathematical Notes, 2004, 75:4, 574–582

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026