Abstract

In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such entropic measures can be very important and useful to analyze and compare complex systems by means of networks. The novel graph entropy definition is based on local vertex functionals obtained by calculating j-spheres via the algorithm of Dijkstra. We state some lower and upper bounds of the defined graph entropy to estimate the structural information content for graph classes or explicitly given graphs. Second, we present a detailed example for calculating the graph entropies of a special graph class.

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 call

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.