The resistance distance between two vertices of a simple connected graph G is equal to the
resistance between two equivalent points on an electrical network, constructed so as to …

Fractals are geometric patterns that appear self-similar across all length scales and are
constructed by repeating a single unit on a regular basis. Entropy, as a core thermodynamic …

Let G be a simple graph with vertex set V ( G ) and edge set E ( G ) . The resistance distance
R G ( x , y ) between two vertices x , y of G, is defined to be the effective resistance between …

Molecular fractals are geometric patterns that appear self-similar across all length scales
and are constructed by repeating a single unit on a regular basis. Entropy, as a core …

Let G be a simple molecular graph without directed and multiple edges and without loops.
The vertex and edge-sets of G are denoted by V(G) and E(G), respectively. Suppose G is also …

An (n, m)-graph is a graph with n vertices and m edges. The vertex-degree function-index Hf
(G) of a graph G is defined as Hf (G)=∑ v∈ V (G) f (d (v)), where f is a real function. In this …

Let G be a graph with vertex set V(G). For $$u,v\in V(G)$$ u , v ∈ V ( G ) , we write $$v\sim u$$
v ∼ u if vertices v and u are adjacent. The Cartesian product of G and H, denoted by $$G\…

Let G = ( V ( G ) , E ( G ) ) be a graph with vertex set V ( G ) and edge set E ( G ) . The line graph
L G of G is the graph with E ( G ) as its vertex set and two vertices of L G are adjacent in L …

The eigenvalues of normalized Laplacian are extremely important for analyzing the structure
properties of non-regular graphs. A molecular graph of generalized phenylene L n is a …

Distance-decay (DD) equations can discern the biogeographical pattern of organisms and
genes in a better way with advanced statistical methods. Here, we developed a data …