Search

A molecular descriptor is a mathematical measure that associates a molecular graph with some real numbers and predicts the various biological, chemical, and structural properties of the underlying molecular graph. Wiener (1947) and Trinjastic and Gutman (1972) used molecular descriptors to find the boiling point of paraffin and total π -electron energy of the molecules, respectively. For molecular graphs, the general sum-connectivity and general Randić are well-studied fundamental topological indices (TIs) which are considered as degree-based molecular descriptors. In this paper, we obtain the bounds of the aforesaid TIs for the generalized F -sum graphs. The foresaid TIs are also obtained for some particular classes of the generalized F -sum graphs as the consequences of the obtained results. At the end, 3 D -graphical presentations are also included to illustrate the results for better understanding.

Neural networks in which communication works only among the neighboring units are called cellular neural networks (CNNs). These are used in analyzing 3D surfaces, image processing, modeling biological vision, and reducing nonvisual problems of geometric maps and sensory-motor organs. Topological indices (TIs) are mathematical models of the (molecular) networks or structures which are presented in the form of numerical values, constitutional formulas, or numerical functions. These models predict the various chemical or structural properties of the under-study networks. We now consider analogous graph invariants, based on the second connection number of vertices, called Zagreb connection indices. The main objective of this paper is to compute these connection indices for the cellular neural networks (CNNs). In order to find their efficiency, a comparison among the obtained indices of CNN is also performed in the form of numerical tables and 3D plots.

The hyper-Zagreb index is an important branch in the Zagreb indices family, which is defined as∑uv∈E(G)‍(d(u)+d(v))2, whered(v)is the degree of the vertexvin a graphG=(V(G),E(G)). In this paper, the monotonicity of the hyper-Zagreb index under some graph transformations was studied. Using these nice mathematical properties, the extremal graphs amongn-vertex trees (acyclic), unicyclic, and bicyclic graphs are determined for hyper-Zagreb index. Furthermore, the sharp upper and lower bounds on the hyper-Zagreb index of these graphs are provided.

We propose a new set-valued risk measure, which is called set-valued Haezendonck-Goovaerts risk measure. First, we construct the set-valued Haezendonck-Goovaerts risk measure and then provide an equivalent representation. The properties of the set-valued Haezendonck-Goovaerts risk measure are investigated, which show that the set-valued Haezendonck-Goovaerts risk measure is coherent. Finally, an example of set-valued Haezendonck-Goovaerts risk measure is given, which exhibits the fact that the set-valued average value at risk is a particular case of the set-valued Haezendonck-Goovaerts risk measures.

In electric circuit theory, it is of great interest to compute the effective resistance between any pairs of vertices of a network, as well as the Kirchhoff index. LetQ(G)be the graph obtained fromGby inserting a new vertex into every edge ofGand by joining by edges those pairs of these new vertices which lie on adjacent edges ofG. The set of such new vertices is denoted byI(G). TheQ-vertex corona ofG1andG2, denoted byG1⊙QG2, is the graph obtained from vertex disjointQ(G1)andVG1copies ofG2by joining theith vertex ofV(G1)to every vertex in theith copy ofG2. TheQ-edge corona ofG1andG2, denoted byG1⊖QG2, is the graph obtained from vertex disjointQ(G1)andIG1copies ofG2by joining theith vertex ofI(G1)to every vertex in theith copy ofG2. The objective of the present work is to obtain the resistance distance and Kirchhoff index for composite networks such asQ-vertex corona andQ-edge corona networks.

The resistance distance between any two vertices ofGis defined as the network effective resistance between them if each edge ofGis replaced by a unit resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all the pairs of vertices inG. We firstly provided an exact formula for the Kirchhoff index of the hypercubes networksQnby utilizing spectral graph theory. Moreover, we obtained the relationship of Kirchhoff index between hypercubes networksQnand its three variant networksl(Qn),s(Qn),t(Qn)by deducing the characteristic polynomial of the Laplacian matrix related networks. Finally, the special formulae for the Kirchhoff indexes ofl(Qn),s(Qn), andt(Qn)were proposed, respectively.