Isospectral genus two graphs are isomorphic

DOI10.26493/1855-3974.550.E1AMaRDI QIDQ2827776zbMATH OpenOpenAlexWikidataFDO

Authors Alexander Mednykh, I. A. Mednykh

Publication date 21 October 2016

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.550.e1a

zbMATH Keywords

cospectral graphdetermined by spectrumeigenvaluesgenusisospectral graphLaplaciantheta graphs

Mathematics Subject Classification ID

Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Isospectrality (58J53)

Review text

The genus of a finite and connected graph \(G=(V,E)\) is the dimension of its first homology group and it equals \(|E|-|V|+1\). The graphs of genus \(0\) are trees and graphs of genus \(1\) are cycles. The graphs of genus \(2\) are theta graphs which are defined as follows; if \(u\) and \(v\) are two (not necessarily distinct) vertices, denote by \(\Theta(k,l,m)\) the graph consisting of three internally disjoint paths joining \(u\) to \(v\) with lengths \(k,l,m\geq 0\) and \(kl+lm+mk>0\). A bridge is an edge of \(G\) whose deletion disconnects \(G\). A graph is bridgeless if it contains no bridges.NEWLINENEWLINEThe Laplacian of \(G\) is \(L=D-A\), where \(A\) is the adjacency matrix and \(D\) is the diagonal degree matrix of \(G\). Two graphs are called Laplacian isospectral or cospectral if their Laplacian eigenvalues are the same (including multiplicities).NEWLINENEWLINEThe main result of this paper is showing that two genus two bridgless graphs are Laplacian isospectral if and only if they are isomorphic. The authors remark that this result is not true for genus two graphs with bridges or for bridgeless graphs of genus three or for graphs of genus one.

Recommendations

• Large families of laplacian isospectral graphs
• Two kinds of bicyclic graphs are determined by their Laplacian spectra
• Two classes of bicyclic graphs are determined by their Laplacian spectrum
• On the graphs with larger Laplacian eigenvalues equal to two
• scientific article; zbMATH DE number 867649

Cited in

(7)

• Mutually isospectral Riemann surfaces
• Isospectral surfaces of genus two and three
• Large families of laplacian isospectral graphs
• scientific article; zbMATH DE number 1124555 (Why is no real title available?)
• scientific article; zbMATH DE number 1126815 (Why is no real title available?)
• scientific article; zbMATH DE number 2158390 (Why is no real title available?)
• Hearing shapes viap-adic Laplacians

This page was built for publication: Isospectral genus two graphs are isomorphic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827776)