Cospectrality of multipartite graphs

Alireza Abdollahi, Nilofar Zakeri


Let G be a graph on n vertices and consider the adjacency spectrum of G as the ordered n-tuple whose entries are eigenvalues of G written decreasingly. Let G and H be two non-isomorphic graphs on n vertices with spectra S and T, respectively. Define the distance between the spectra of G and H as the distance of S and T to a norm N of the n-dimensional vector space over real numbers. Define the cospectrality of G as the minimum of distances between the spectrum of G and spectra of all other non-isomorphic n vertices graphs to the norm N. In this paper we investigate copsectralities of the cocktail party graph and the complete tripartite graph with parts of the same size to the Euclidean or Manhattan norms.


Spectra of graphs, cospectrality of graphs, adjacency matrix of a graph, Euclidean norm, Manhattan norm

Full Text:



ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications