Figure 2 - uploaded by Shahram Heidarian
Content may be subject to copyright.
Contexts in source publication
Context 1
... 3.1. Let G be the Molecular graph of benzyl ether dendrimers with C 60 H core (see Fig. 1). Then the following relations are hold: Proof. The growth of two similar branches and three stages are shown in Fig. 1. These indices are computed from the stage k. The central part of Fig. 1 is shown in Fig. 2 and it is easy to see that ...
Context 2
... to Fig. 2 Now, the multiplicative Zagreb indices are computed through the link of graph G 1 and G 1 as observe in Fig. 3. It is easy to see that ...
Similar publications
An obvious way to alleviate memory difficulties in GPU-based AI computing is via CPU offload, where data are moved between GPU and CPU RAM, so inexpensive CPU RAM is used to increase the amount of storage available. While CPU offload is an obvious idea, it can greatly slow down a computation, due to the relatively slow transfer rate between CPU RAM...
The article introduces a new method for applying Quantum Clustering to graph structures. Quantum Clustering (QC) is a density-based unsupervised learning method that determines cluster centers by constructing a potential function. In this method, we develop the Graph Gradient Descent algorithm to find the centers of clusters for graph analysis. GPU...
Aiming at the issue of communication overload and task backlog caused by the dynamic nature of the environment and the surge in the number of mobile devices in multi-user Mobile Edge Computing scenarios, a dynamic task offloading strategy based on Lyapunov-guided multi-agent deep reinforcement learning is proposed. This strategy aims to ensure long...
Let G be a graph with n vertices and CG=X:X is an l-clique of G. A vertex v∈VG is said to resolve a pair of cliques X,Y in G if dGv,X≠dGv,Y where dG is the distance function of G. For a pair of cliques X,Y, the resolving neighbourhood of X and Y, denoted by RGX,Y, is the collection of all vertices which resolve the pair X,Y. A subset S of VG is cal...
Automatic image annotation has absorbed a few research interests in recent decades quietly. Nevertheless, most methods leave graph structure out of consideration or utilize merely the graph without semantic information to capture manifold information of samples. Furthermore, it is inaccurate to consider the label matrix of a dataset as the feature...
