Abstract
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph. The generalized graph entropies result from applying information measures to a graph using various schemes for defining probability distributions over the elements of the graph. In this paper, the first Zagreb index of a class of composite graphs, namely, subdivision-vertex and subdivision-edge join graphs are investigated in order to evaluate the generalized graph entropies, and explicit formulae for the generalized graph entropy of subdivision-vertex and subdivision-edge join graphs are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
