MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB
From MaRDI portal
Publication:5086261
DOI10.1142/S0218348X22500773zbMath1492.05130MaRDI QIDQ5086261
Xiao-Jie Wang, Kai Yu, Wushour Slamu, Yixin Zhu
Publication date: 5 July 2022
Published in: Fractals (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractals (28A80)
Related Items (1)
Cites Work
- Unnamed Item
- Maximum matchings in scale-free networks with identical degree distribution
- The complexity of computing the permanent
- Spanning trees on the Sierpinski gasket
- Dimer coverings on the Sierpinski gasket
- Matching theory
- Harmony in the small-world
- Minimum structural controllability problems of complex networks
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
- Perfect matchings in random intersection graphs
- Pfaffian orientations and perfect matchings of scale-free networks
- Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Controllability and matchings in random bipartite graphs
- DIMERS ON TWO-DIMENSIONAL LATTICES
- A box-covering algorithm for fractal scaling in scale-free networks
- The Complexity of Enumeration and Reliability Problems
- The Structure and Function of Complex Networks
- DISTINGUISHING BETWEEN SIERPINSKI TRIANGLE CONSTRUCTIONS
- THE SCALE-FREE AND SMALL-WORLD PROPERTIES OF COMPLEX NETWORKS ON SIERPINSKI-TYPE HEXAGON
- MEAN VALUE PROPERTY OF HARMONIC FUNCTION ON THE HIGHER-DIMENSIONAL SIERPINSKI GASKET
- Collective dynamics of ‘small-world’ networks
This page was built for publication: MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB
