Weakly cospectral graphs
type: Item
instance of: scholarly article
title: Weakly cospectral graphs
zbMATH Open document ID: 1053.05083
author: S. P. Strunkov
published in: Mathematical Notes
publication date: 2004-12-06T00:00:00Z
review text: In the paper finite pseudographs and pseudodigraphs, i.e. undirected and directed finite graphs with multiple edges and loops, are considered. Two pseudographs (pseudodigraphs) \(G\) and \(F\) are called weakly cospectral if each eigenvalue of the adjacency matrix \(M(G)\) of the pseudograph (pseudodigraph) \(G\) is an eigenvalue of the adjacency matrix \(M(F)\) of the pseudograph (pseudodigraph) \(F\) and vice versa. 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.
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 2121389
zbMATH Keywords: pseudograph
zbMATH Keywords: pseudodigraph
zbMATH Keywords: weak cospectrality
zbMATH Keywords: graph spectrum
zbMATH Keywords: adjacency matrix
zbMATH Keywords: degree of a graph
zbMATH Keywords: indegree
zbMATH Keywords: outdegree
reviewed by: Vladimir Fleischer
MaRDI profile type: Publication
full work available at URL: b:matn.0000023339.74662.ad
OpenAlex ID: W2122095551
DOI: 10.1023/B:MATN.0000023339.74662.AD
Recommended article: On weakly cospectral graphs
Recommended article: On weakly cospectral graphs.
Recommended article: Cospectrality of graphs
Recommended article: Q3001405
Recommended article: Weakly triangulated graphs
Recommended article: Graphs cospectral with distance-regular graphs
Recommended article: Cospectral graphs and the generalized adjacency matrix
Recommended article: Cospectrality of multipartite graphs
Recommended article: Q3220630
Recommended article: Weak degeneracy of graphs
description: scientific article; zbMATH DE number 2121389