On topological aspects of degree based entropy for two carbon nanosheets

The entropy-based procedures from the configuration of chemical graphs and multifaceted networks, several graph properties have been utilized. For computing, the organizational evidence of organic graphs and multifaceted networks, the graph entropies have converted the information-theoretic magnitudes. The graph entropy portion has attracted the research community due to its potential application in chemistry. In this paper, our input is to reconnoiter graph entropies constructed on innovative information function, which is the quantity of different degree vertices along with the quantity of edges between innumerable degree vertices.”In this study, we explore two dissimilar curricula of carbon nanosheets that composed by C4 and C8 denoted by T1C4C8(S)[m, n] and T2C4C8(R)[m, n]. Additionally, we calculate entropies of these configurations by creating a connection of degree-based topological indices with the advantage of evidence occupation