COSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES

Document Type : Research Paper

Authors

1 University of Isfahan

2 Shiraz University

Abstract

Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let Gn and Gn be two nonisomorphic simple graphs on n vertices with spectra
lambda1geqlambda2geqcdotsgeqlambdan;;;textand;;;lambda1geqlambda2geqcdotsgeqlambdan, respectively. Define the distance between the spectra of Gn and Gn as
lambda(Gn,Gn)=sumi=1n(lambdailambdai)2;;;big(textoruse;sumi=1n|lambdailambdai|big).
Define the cospectrality of Gn by
textcs(Gn)=minlambda(Gn,Gn);:;Gn;;textnotisomorphicto;Gn.
Let textcsn=maxtextcs(Gn);:;Gn;;textagraphon;n;textvertices.
Investigation of textcs(Gn) for special classes of graphs and finding a good upper bound on textcsn are two main questions in this
subject.
In this paper, we briefly give some important results in this direction and then we collect all cospectrality measures of graphs with at most six vertices with respect to three norms. Also, we give the shape of all graphs that are closest (with respect to cospectrality measure) to a given graph G.

Keywords


[1] D. Stevanivi´c, Research problems from the Aveiro workshop on graph spectra, Linear Algebra and its Applications, 423 (2007) 172-181.
[2] A. Abdollahi and M. R. Oboudi, Cospectrality of graphs, Linear Algebra and its Applications, 451 (2014) 169-181.
[3] A. Abdollahi, Sh. Janbaz and M. R. Oboudi, Distance between spectra of graphs, Linear Algebra and its Applications, 466 (2015) 401-408.
[4] T. Tao, Topics in Random Matrix Theory, Graduate Studies in Mathematics, American Mathematical Society, Volume 132, 2012.