Computing the spanning trees number in a graph is the most important studied problems in graph theory. Matrix tree theorem was the first method computing this graph parameter, which has been inefficient. That why computing this number remains a challenge, especially for large graph such as complex networks. For this reason we developed a combinatorial method computing the number of spanning trees in a families graph. In this work, we aimed to compute the number of spanning trees in the corona

more »

... oduct graph of a chain planar graphs and an Outer planar graph, using our recursive method to investigate an explicit computing this number.