COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB
DOI10.1142/s0218348x23500226zbMath1517.05184arXiv2301.03230MaRDI QIDQ6158062
Wei Li, Unnamed Author, Unnamed Author, Yucheng Wang, Zhong-Zhi Zhang, Unnamed Author
Publication date: 22 June 2023
Published in: Fractals (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.03230
combinatorial problemindependence numbersimplicial complexchromatic numberperfect matchingdomination numberacyclic orientationsspanning treesgraph productpseudo-fractal
Graph theory (including graph drawing) in computer science (68R10) Fractals (28A80) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inapproximability of dominating set on power law graphs
- On the number of minimal dominating sets on some graph classes
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
- The complexity of computing the permanent
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Networks beyond pairwise interactions: structure and dynamics
- Incompatibility networks as models of scale-free small-world graphs
- The hierarchical product of graphs
- Matching theory
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
- Maximum matching in regular and almost regular graphs
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Acyclic orientations of graphs
- Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network
- Clique topology reveals intrinsic geometric structure in neural correlations
- Emergence of Scaling in Random Networks
- Applications of E-graphs in network design
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- The Complexity of Enumeration and Reliability Problems
- Matchings and phylogenetic trees
- Algebraic Graph Theory
- The Structure and Function of Complex Networks
- Exact calculations of first-passage properties on the pseudofractal scale-free web
- Invariants of E-graphs
- On Dominating Sets and Independent Sets of Graphs
- EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET
- The Master Stability Function for Synchronization in Simplicial Complexes
- LAZY RANDOM WALKS ON PSEUDOFRACTAL SCALE-FREE WEB WITH A PERFECT TRAP
- MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB
- $P$-persistent homology of finite topological spaces
- Maximizing the Number of Spanning Trees in a Connected Graph
- Simplicial complexes and complex systems
- Collective dynamics of ‘small-world’ networks
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB
