Cospectrality Measures of Graphs With At Most Six Vertices

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 gngn and g′ngn′ be two nonisomorphic simple graphs on nn vertices with spectra lambda1geqlambda2geqcdotsgeqlambdan;;;textand;;;l ambda′1geqlambda′2geqcdotsgeqlambda′n, lambda1geqlambda2geqcdotsgeqlambdan;;;textand;;;lambda1′geqlambda2′geqcdotsgeqlambdan′, respectively. define the distance between the spectra of gngn and g′ngn′ as lambda(gn,g′n)=sumni=1(lambdai−lambda′i)2;:;big (textoruse;sumni=1|lambdai−lambda′i|big). lambda(gn,gn′)=sumi=1n(lambdai−lambdai′)2;:;big (textoruse;sumi=1n|lambdai−lambdai′|big). define the cospectrality of gngn by textcs(gn)=minlambda(gn,g′n);:;g ′n;;textnotisomorphicto;gn.textcs(gn)=minlambda (gn,gn′);:;gn′;;textnotisomorphicto;gn. let textcsn=maxtextcs (gn);:;gn;;textagraphon;n;textvertices.textcsn=maxtextcs(gn);:;gn;;textagraphon;n;textvertices. investigation of textcs(gn)textcs(gn) for special classes of graphs and finding a good upper bound on textcsntextcsn 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 gg.