COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB
From MaRDI portal
Publication:6158062
Abstract: Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a graph product, which is an extension of the pseudo-fractal scale-free web. We determine explicitly the independence number, the domination number, and the chromatic number. Moreover, we derive closed-form expressions for the number of acyclic orientations, the number of root-connected acyclic orientations, the number of spanning trees, as well as the number of perfect matchings for some particular cases.
Cites work
- scientific article; zbMATH DE number 1369835 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- Acyclic orientations of graphs
- Algebraic Graph Theory
- Applications of E-graphs in network design
- Clique topology reveals intrinsic geometric structure in neural correlations
- Collective dynamics of `small-world' networks
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
- Edge domination number and the number of minimum edge dominating sets in pseudofractal scale-free web and Sierpiński gasket
- Emergence of Scaling in Random Networks
- Exact calculations of first-passage properties on the pseudofractal scale-free web
- Inapproximability of dominating set on power law graphs
- Incompatibility networks as models of scale-free small-world graphs
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
- Invariants of E-graphs
- Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network
- Lazy random walks on pseudofractal scale-free web with a perfect trap
- Matching theory
- Matchings and phylogenetic trees
- Maximizing the Number of Spanning Trees in a Connected Graph
- Maximum matching in regular and almost regular graphs
- Maximum matchings in a pseudofractal scale-free web
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Network science. With Márton Pósfai
- Networks beyond pairwise interactions: structure and dynamics
- On Dominating Sets and Independent Sets of Graphs
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- On the number of minimal dominating sets on some graph classes
- Simplicial complexes and complex systems
- The Complexity of Enumeration and Reliability Problems
- The Master Stability Function for Synchronization in Simplicial Complexes
- The Structure and Function of Complex Networks
- The complexity of computing the permanent
- The hierarchical product of graphs
- \(P\)-persistent homology of finite topological spaces
This page was built for publication: COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6158062)
