Autor:	S. P. Strunkov
Rok vydání:	2004
Předmět:	Discrete mathematics Set (abstract data type) Combinatorics General Mathematics Pairwise comparison Regular graph Adjacency matrix Mathematics
Zdroj:	Mathematical Notes. 75:574-582
ISSN:	0001-4346
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c328b7cbc0faf61d6ecb73fac78184da https://doi.org/10.1023/b:matn.0000023339.74662.ad Zobrazit plný text záznamu Plný text ve formátu PDF