Back to Search
Start Over
MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB.
- Source :
- Fractals; Jun2022, Vol. 30 Issue 4, p1-8, 8p
- Publication Year :
- 2022
-
Abstract
- The maximum matching problem is of great interest in many areas, for example, statistical physics and theoretical computer science. However, precise determining of maximum matchings in general graphs is a challenge and calculationally intractable. In this paper, we study analytically maximum matching problem in the pseudofractal scale-free web. We derive exact expressions for size and number of maximum matchings of the network based on self-similar structure and iterative construction of network, and obtain asymptotic incremental constant for the number of maximum matchings. The obtained results are helpful to understand the structural characteristics of scale-free networks with pseudofractality. [ABSTRACT FROM AUTHOR]
- Subjects :
- STATISTICAL physics
SCALE-free network (Statistical physics)
COMPUTER science
Subjects
Details
- Language :
- English
- ISSN :
- 0218348X
- Volume :
- 30
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Fractals
- Publication Type :
- Academic Journal
- Accession number :
- 157178727
- Full Text :
- https://doi.org/10.1142/S0218348X22500773