|
This article is cited in 1 scientific paper (total 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.
Received: 10.01.2003 Revised: 28.05.2003
Citation:
S. P. Strunkov, “Weakly Cospectral Graphs”, Mat. Zametki, 75:4 (2004), 614–623; Math. Notes, 75:4 (2004), 574–582
Linking options:
https://www.mathnet.ru/eng/mzm57https://doi.org/10.4213/mzm57 https://www.mathnet.ru/eng/mzm/v75/i4/p614
|
Statistics & downloads: |
Abstract page: | 480 | Full-text PDF : | 211 | References: | 86 | First page: | 3 |
|