Maximizing influences in complex networks is a practically important but...
Critical nodes in networks are extremely vulnerable to malicious attacks...
The operation of creating edges has been widely applied to optimize rele...
The function or performance of a network is strongly dependent on its
ro...
Resistance distance has been studied extensively in the past years, with...
Concomitant with the tremendous prevalence of online social media platfo...
Simplicial complexes are a popular tool used to model higher-order
inter...
For a connected graph 𝒢=(V,E) with n nodes, m edges, and
Laplacian matri...
As a fundamental issue in network analysis, structural node similarity h...
The operation of adding edges has been frequently used to the study of
o...
As a fundamental research object, the minimum edge dominating set (MEDS)...
The issue of opinion sharing and formation has received considerable
att...
One of the main subjects in the field of social networks is to quantify
...
Many graph products have been applied to generate complex networks with
...
The k-power domination problem is a problem in graph theory, which has
a...
Graph operations or products, such as triangulation and Kronecker produc...
The problem of increasing the centrality of a network node arises in man...
We study the problem of maximizing the number of spanning trees in a
con...
As a fundamental subject of theoretical computer science, the maximum
in...
Current flow closeness centrality (CFCC) has a better discriminating abi...
Various graph products and operations have been widely used to construct...
The Apollonian networks display the remarkable power-law and small-world...