On the fixed edge of planar graphs with minimum degree five

An edge e of a finite and simple graph G is called a fixed edge of G if G - e + e′ ≅ G implies e′ = e. In this paper, we show that planar graphs with minimum degree 5 contain fixed edges, from which we prove that a class of planar graphs with minimum degree one is edge reconstructible.