Maximum matchings in a pseudofractal scale-free web

DOI10.1142/S0218348X22500773zbMATH Open1492.05130MaRDI QIDQ5086261FDOQ5086261

Authors: Xiaojie Wang, Wushour Slamu, Kai Yu, Yixin Zhu 

Publication date: 5 July 2022

Published in: Fractals (Search for Journal in Brave)

Recommendations

• Maximum matchings in scale-free networks with identical degree distribution
• Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
• Pfaffian orientations and perfect matchings of scale-free networks
• On matchings in graphs
• Small maximal matchings in random graphs.

zbMATH Keywords

complex networkmaximum matchingpseudofractal scale-free web

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractals (28A80)

Cites Work

• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Perfect matchings in random intersection graphs
• Collective dynamics of ‘small-world’ networks
• Matching theory
• The complexity of computing the permanent
• The Complexity of Enumeration and Reliability Problems
• Pfaffian orientations and perfect matchings of scale-free networks
• Spanning trees on the Sierpinski gasket
• DIMERS ON TWO-DIMENSIONAL LATTICES
• Harmony in the small-world
• Dimer coverings on the Sierpinski gasket
• A box-covering algorithm for fractal scaling in scale-free networks
• Controllability and matchings in random bipartite graphs
• Maximum matchings in scale-free networks with identical degree distribution
• Title not available (Why is that?)
• Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs
• Minimum structural controllability problems of complex networks
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
• MEAN VALUE PROPERTY OF HARMONIC FUNCTION ON THE HIGHER-DIMENSIONAL SIERPINSKI GASKET
• DISTINGUISHING BETWEEN SIERPINSKI TRIANGLE CONSTRUCTIONS
• THE SCALE-FREE AND SMALL-WORLD PROPERTIES OF COMPLEX NETWORKS ON SIERPINSKI-TYPE HEXAGON

Cited In (1)

• COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB

This page was built for publication: Maximum matchings in a pseudofractal scale-free web

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