Work

Calculating the entropy and number of spanning trees of a complex network model

Year: 2025

Type: article

Abstract: In real-world situations, complex networks are prevalent. Free-scale networks, small-world networks, and fractalsare examples of complex networks. In this paper, we generalize the models presented for El Atik and Ma. We discuss some topological properties of the proposed model like the clustering coefficient and the diameter. Also, the entropy and the number of spanning trees are significant measures related to the reliability and communication aspects of the network. Therefore, we calculate analytically the entropy and number of spanning trees of the model, which clarifies that the results of El Atik et al. are unerring whereas the given results of Ma and Yao are erroneous.

Source: Journal of the Egyptian Mathematical Society

DOI: 10.21608/joems.2025.425244

Authors: Fatma ElSafty, A. W. Aboutahoun

Institutions: Damanhour University, Zewail City of Science and Technology, Alexandria University

Language: English

Topic: Graph theory and applications

Subfield: Geometry and Topology

Field: Mathematics

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W4410136957

FWCI:

Cites:

Cited by:

Related to: 10