The vast majority of real-world networks are scale-free, loopy, and sparse, with a power-law
degree distribution and a constant average degree. In this paper, we study first-order …

Hierarchical product of graphs has found wide applications in various fields, eg polymer and
biological networks. In this paper, we study the topological and spectral properties of …

In this study, a method has been developed for solving the maximum independent set
problem, which is one of the significant problems in graph theory. The maximum …

A striking discovery in the field of network science is that the majority of real networked
systems have some universal structural properties. In general, they are simultaneously …

Subdivision, triangulation, Kronecker product, corona product and many other graph
operations or products play an important role in complex networks. In this paper, we study …

In this paper, we propose a class of growth models, named Fibonacci trees F (t), with respect
to the nature of Fibonacci sequence {F t}. First, we show that models F (t) have power-law …

Combinatorial problems are a fundamental research subject of theoretical computer
science, and for a general graph many combinatorial problems are NP-hard and even# P …

Graph operations or products, such as triangulation and Kronecker product have been
extensively applied to model complex networks with striking properties observed in real …

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 …