Maximum matchings in a pseudofractal scale-free web

DOI10.1142/S0218348X22500773MaRDI QIDQ5086261zbMATH OpenFDO

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

Publication date 5 July 2022

Published in Fractals (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218348X22500773

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)

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.

Cites work

• scientific article; zbMATH DE number 3227563 (Why is no real title available?)
• A box-covering algorithm for fractal scaling in scale-free networks
• Collective dynamics of `small-world' networks
• Controllability and matchings in random bipartite graphs
• DIMERS ON TWO-DIMENSIONAL LATTICES
• Dimer coverings on the Sierpinski gasket
• Distinguishing between Sierpinski triangle constructions
• Emergence of Scaling in Random Networks
• Harmony in the small-world
• MEAN VALUE PROPERTY OF HARMONIC FUNCTION ON THE HIGHER-DIMENSIONAL SIERPINSKI GASKET
• Matching theory
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
• Maximum matchings in scale-free networks with identical degree distribution
• Minimum structural controllability problems of complex networks
• Perfect matchings in O(n n) time in regular bipartite graphs
• Perfect matchings in random intersection graphs
• Pfaffian orientations and perfect matchings of scale-free networks
• Spanning trees on the Sierpinski gasket
• Statistical mechanics of complex networks
• The Complexity of Enumeration and Reliability Problems
• The Structure and Function of Complex Networks
• The complexity of computing the permanent
• The scale-free and small-world properties of complex networks on Sierpinski-type hexagon

Cited in

(5)

• COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
• 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
• Maximum matchings in scale-free networks with identical degree distribution

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)