Girth Inequality In Planar Graphs

As defined ingraph theory, the girth of a given graph is the length of its shortest cycle. Most of the papers, that mentioned the girth of a graph, I will mention here[1, 2, 3 and 4], investigated other features when the girth was one of the data, or described algorithms to find the girth when the graph is given. The purpose of this paper is to give inequalities, which explains girth’s relationship with the number of edges, the number of vertices and the number of faces, in a planar and connected graph