Let G be a simple connected graph in chemical graph theory and uν e = be an edge of G. The Randić index ( ) G χ and sum-connectivity ( ) G X of a nontrivial connected graph G are defined as the sum of the weights ν ud d 1 and ν u d d + 1 over all edges ν u e = of G, respectively. In this paper, we compute Randić ( ) G χ and sum-connectivity ( ) G X indices of V-phenylenic nanotubes and nanotori.

Kernel methods, such as support vector machines, have been applied to solving various problems in bioinformatics. Recently, marginalized kernels between labeled graphs have been proposed [2, 3], which enable the application of kernel methods to the analysis and classification of chemical compounds such as QSAR (quantitative structure-activity relationship). These graph kernels are based on the ...

In this work, the bond graph approach is employed to develop an integrated chemical reactor model, able to be exploited for supervision and diagnosis of industrial process. The obtained model is evolutive and generic comparing with the first principle methods. Moreover, this methodology is based on systematic approach which allows to represent the dynamic behaviour of complex process under non ...

The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability number and the order of general graphs and connected graphs. Turán graphs frequently appear in extremal graph theory. We show that Turán graphs and a conne...

Motivated by recent progress on the interplay between graph theory, dynamics, and systems theory, we revisit the analysis of chemical reaction networks described by mass action kinetics. For reaction networks possessing a thermodynamic equilibrium we derive a compact formulation exhibiting at the same time the structure of the complex graph and the stoichiometry of the network, and which admits...

Graphs are powerful data structure to represent objects and their concepts. Objects are nothing but nodes and edges describes relation among objects. Number of real world problems is represented by graph. Graph isomorphism is the area of pattern matching and widely used in various applications such as image processing, protein structure, computer and information system, chemical bond structure,...

let $g$ be a simple connected graph. the edge-wiener index $w_e(g)$ is the sum of all distances between edges in $g$, whereas the hyper edge-wiener index $ww_e(g)$ is defined as {footnotesize $w{w_e}(g) = {frac{1}{2}}{w_e}(g) + {frac{1}{2}} {w_e^{2}}(g)$}, where {footnotesize $ {w_e^{2}}(g)=sumlimits_{left{ {f,g} right}subseteq e(g)} {d_e^2(f,g)}$}. in this paper, we present explicit formula fo...