The Hosoya index of graphs formed by a fractal graph
JB Liu, J Zhao, J Min, J Cao - Fractals, 2019 - World Scientific
The computational complexity of the Hosoya index of a given graph is NP-Complete. Let RT
(G) be the graph constructed from R (G) by a triangle instead of all vertices of the initial …
(G) be the graph constructed from R (G) by a triangle instead of all vertices of the initial …
On the spectrum of the normalized Laplacian of iterated triangulations of graphs
The eigenvalues of the normalized Laplacian of a graph provide information on its
topological and structural characteristics and also on some relevant dynamical aspects …
topological and structural characteristics and also on some relevant dynamical aspects …
Exact solution for mean first-passage time on a pseudofractal scale-free web
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are
limited to some simple structure, eg, regular lattices and regular geometrical fractals, and …
limited to some simple structure, eg, regular lattices and regular geometrical fractals, and …
Modelling of combinable relationship-based composition service network and the theoretical proof of its scale-free characteristics
Existing works on service composition are primarily based on the requirements of service
composition, such as describing language supporting service composition, service …
composition, such as describing language supporting service composition, service …
Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
A vast variety of real-life networks display the ubiquitous presence of scale-free
phenomenon and small-world effect, both of which play a significant role in the dynamical …
phenomenon and small-world effect, both of which play a significant role in the dynamical …
Maximal planar scale-free Sierpinski networks with small-world effect and power law strength-degree correlation
Many real networks share three generic properties: they are scale-free, display a small-
world effect, and show a power law strength-degree correlation. In this paper, we propose a …
world effect, and show a power law strength-degree correlation. In this paper, we propose a …
Recent progress on the analysis of power-law features in complex cellular networks
JC Nacher, T Akutsu - Cell biochemistry and biophysics, 2007 - Springer
Complex interactions between different kinds of bio-molecules and essential nutrients are
responsible for cellular functions. Rapid advances in theoretical modeling and experimental …
responsible for cellular functions. Rapid advances in theoretical modeling and experimental …
Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
In this paper, firstly, we study analytically the topological features of a family of hierarchical
lattices (HLs) from the view point of complex networks. We derive some basic properties of …
lattices (HLs) from the view point of complex networks. We derive some basic properties of …
Low-mean hitting time for random walks on heterogeneous networks
Y Sheng, Z Zhang - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
Mean hitting time for random walks on a network, defined as the average of hitting times
over all possible pairs of nodes, has found a large variety of applications in many areas. In …
over all possible pairs of nodes, has found a large variety of applications in many areas. In …