Weakly cospectral graphs (Q1889641)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Weakly cospectral graphs |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Weakly cospectral graphs |
scientific article |
Statements
Weakly cospectral graphs (English)
0 references
6 December 2004
0 references
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.
0 references
pseudograph
0 references
pseudodigraph
0 references
weak cospectrality
0 references
graph spectrum
0 references
adjacency matrix
0 references
degree of a graph
0 references
indegree
0 references
outdegree
0 references