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.
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.
