Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket

03/02/2018
by   Liren Shan, et al.
0

As a fundamental subject of theoretical computer science, the maximum independent set (MIS) problem not only is of purely theoretical interest, but also has found wide applications in various fields. However, for a general graph determining the size of a MIS is NP-hard, and exact computation of the number of all MISs is even more difficult. It is thus of significant interest to seek special graphs for which the MIS problem can be exactly solved. In this paper, we address the MIS problem in the pseudofractal scale-free web and the Sierpiński gasket, which have the same number of vertices and edges. For both graphs, we determine exactly the independence number and the number of all possible MISs. The independence number of the pseudofractal scale-free web is as twice as the one of the Sierpiński gasket. Moreover, the pseudofractal scale-free web has a unique MIS, while the number of MISs in the Sierpiński gasket grows exponentially with the number of vertices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2021

Edge Domination Number and the Number of Minimum Edge Dominating Sets in Pseudofractal Scale-Free Web and Sierpiński Gasket

As a fundamental research object, the minimum edge dominating set (MEDS)...
research
11/19/2019

The k-Power Domination Number in Some Self-Similar Graphs

The k-power domination problem is a problem in graph theory, which has a...
research
01/09/2023

Combinatorial Properties for a Class of Simplicial Complexes Extended from Pseudo-fractal Scale-free Web

Simplicial complexes are a popular tool used to model higher-order inter...
research
01/31/2021

On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard

The simplicial rook graph 𝒮ℛ(m,n) is the graph whose vertices are vector...
research
09/02/2015

Finding Near-Optimal Independent Sets at Scale

The independent set problem is NP-hard and particularly difficult to sol...
research
04/18/2023

Independence testing for inhomogeneous random graphs

Testing for independence between graphs is a problem that arises natural...
research
09/16/2013

Learning a Loopy Model For Semantic Segmentation Exactly

Learning structured models using maximum margin techniques has become an...

Please sign up or login with your details

Forgot password? Click here to reset