Maximum matchings in scale-free networks with identical degree distribution

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: The size and number of maximum matchings in a network have found a large variety of applications in many fields. As a ubiquitous property of diverse real systems, power-law degree distribution was shown to have a profound influence on size of maximum matchings in scale-free networks, where the size of maximum matchings is small and a perfect matching often does not exist. In this paper, we study analytically the maximum matchings in two scale-free networks with identical degree sequence, and show that the first network has no perfect matchings, while the second one has many. For the first network, we determine explicitly the size of maximum matchings, and provide an exact recursive solution for the number of maximum matchings. For the second one, we design an orientation and prove that it is Pfaffian, based on which we derive a closed-form expression for the number of perfect matchings. Moreover, we demonstrate that the entropy for perfect matchings is equal to that corresponding to the extended Sierpi'nski graph with the same average degree as both studied scale-free networks. Our results indicate that power-law degree distribution alone is not sufficient to characterize the size and number of maximum matchings in scale-free networks.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Maximum matchings in scale-free networks with identical degree distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528496)