Some Combinatorial Problems in Power-law Graphs

04/02/2021
by   Jiang Che, et al.
0

The power-law behavior is ubiquitous in a majority of real-world networks, and it was shown to have a strong effect on various combinatorial, structural, and dynamical properties of graphs. For example, it has been shown that in real-life power-law networks, both the matching number and the domination number are relatively smaller, compared with homogeneous graphs. In this paper, we study analytically several combinatorial problems for two power-law graphs with the same number of vertices, edges, and the same power exponent. For both graphs, we determine exactly or recursively their matching number, independence number, domination number, the number of maximum matchings, the number of maximum independent sets, and the number of minimum dominating sets. We show that power-law behavior itself cannot characterize the combinatorial properties of a heterogenous graph. Since the combinatorial properties studied here have found wide applications in different fields, such as structural controllability of complex networks, our work offers insight in the applications of these combinatorial problems in power-law graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2017

Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs

The Apollonian networks display the remarkable power-law and small-world...
research
03/04/2018

Design, Generation, and Validation of Extreme Scale Power-Law Graphs

Massive power-law graphs drive many fields: metagenomics, brain mapping,...
research
06/15/2021

Asymptotic Behavior of Common Connections in Sparse Random Networks

Random network models generated using sparse exchangeable graphs have pr...
research
01/28/2018

GraphCombEx: A Software Tool for Exploration of Combinatorial Optimisation Properties of Large Graphs

We present a prototype of a software tool for exploration of multiple co...
research
12/23/2019

Graph fractal dimension and structure of fractal networks: a combinatorial perspective

In this paper we study self-similar and fractal networks from the combin...
research
04/29/2022

Preferential attachment hypergraph with vertex deactivation

In the area of complex networks so far hypergraph models have received s...
research
05/23/2018

Rectangular Young tableaux with local decreases and the density method for uniform random generation (short version)

In this article, we consider a generalization of Young tableaux in which...

Please sign up or login with your details

Forgot password? Click here to reset