Abstract
One of the most recent advancements in graph theory is the use of a multidisciplinary approach to the investigation of specific structural dependent features, such as physico-chemical properties, biological activity and the entropy measure of a graph representing objects like a network or a chemical compound. The ability of entropy measures to determine both the certainty and uncertainty about objects makes them one of the most investigated topics in science along with its multidisciplinary nature. As a result, many formulae, based on vertices, edges and symmetry, for determining the entropy of graphs have been developed and investigated in the field of graph theory. These measures assist in understanding the characteristics of graphs, such as the complexity of the networks or graphs, which may be determined using entropy measures. In this paper, we derive formulae of entropy measures of an extensively studied family of the interconnection networks and classify them in terms of complexity. This is accomplished by utilizing all three tools, including analytical formulae, graphical methods and numerical tables.
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 callDisclaimer: 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.
