On the Density of Some Graphs and Corona Graphs

Density in graph is a core metric in graph theory used to quantifies how close a graph is to being connected. The density of a graph is denoted by D(G) as the ratio of the number of edges present in the graph to the maximum possible edges.In undirected graph, the density is given by the ratio of twice the edges of the graph G and the product of the vertices of the graph G and one less than its vertices. In this paper, we investigates the density of graphs such as centipide, helm, crown, ladder, bistar and the corona of two graphs.