Ennumeration of the Number of Spanning Trees in the Lantern Maximal Planar Graph

A maximal planar graph is a simple graph G formed by n vertices, 3(n 2) edges and 2(n 2) faces of degree 3 (all faces having degree 3). In this paper, our contribution is to propose the formula that ennumerate the number of spanning trees in the Lantern maximal planar graph Ln to be (Ln) = n 2 2 (2 + p 3) n 2 + (2 p 3) n 2 2 , then we deduce formulas for its corresponding bipartite and reduced graphs. Mathematics Subject Classication: 05C85, 05C30