Isospectral genus two graphs are isomorphic
Mednykh, Alexander ; Mednykh, Ilya
ARS MATHEMATICA CONTEMPORANEA, Tome 11 (2015), / Harvested from ARS MATHEMATICA CONTEMPORANEA
link
link
link

By a graph we mean a finite connected multigraph without bridges. The genus of a graph is the dimension of its homology group. Two graphs are isospectral is they share the same Laplacian spectrum. We prove that two genus two graphs are isospectral if and only if they are isomorphic. Also, we present two bridgeless genus three graphs that are not isomorphic. The paper is motivated by the following open problem posed by Peter Buser: are isospectral Riemann surfaces of genus two isometric? 

Publié le : 2015-01-01
DOI : https://doi.org/10.26493/1855-3974.550.e1a 
@article{550,
     title = {Isospectral genus two graphs are isomorphic},
     journal = {ARS MATHEMATICA CONTEMPORANEA},
     volume = {11},
     year = {2015},
     doi = {10.26493/1855-3974.550.e1a},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/550}
}

Mednykh, Alexander; Mednykh, Ilya. Isospectral genus two graphs are isomorphic. ARS MATHEMATICA CONTEMPORANEA, Tome 11 (2015) . doi : 10.26493/1855-3974.550.e1a. http://gdmltest.u-ga.fr/item/550/