Expected Values of Molecular Descriptors in Random Polyphenyl Chains
نویسندگان
چکیده
A chemical graph is a model used to indicate combination. In molecular graph, vertices define atoms, and edges are represented as bonds. topological index single number characterize the of molecule. this article, we study properties some special chains. The polyphenyl chains with hexagons graphs aromatic organic compounds. key purpose article explore expected value Sombor, reduced average Sombor for category It was investigated that revealed adequate discriminative potential alkanes. has been tested these indicators can be effectively in modeling thermodynamic structures. set all spiro random determined. Finally, ratio between values mentioned indices both resolved. Doi: 10.28991/ESJ-2022-06-01-012 Full Text: PDF
منابع مشابه
Random molecular substructures as fragment-type descriptors
A novel approach for analysis of structure-activity relationships for sets of active compounds is reported. Molecular similarity relationships are analyzed among compounds with related biological activity based on the evaluation of randomly generated fragment populations. Fragments are randomly generated by iterative bond deletion in molecular graphs and hence depart from those obtained by well...
متن کاملHosoya polynomials of random benzenoid chains
Let $G$ be a molecular graph with vertex set $V(G)$, $d_G(u, v)$ the topological distance between vertices $u$ and $v$ in $G$. The Hosoya polynomial $H(G, x)$ of $G$ is a polynomial $sumlimits_{{u, v}subseteq V(G)}x^{d_G(u, v)}$ in variable $x$. In this paper, we obtain an explicit analytical expression for the expected value of the Hosoya polynomial of a random benzenoid chain with $n$ hexagon...
متن کاملTree-like Polyphenyl Chains with Extremal Degree Distance
Let G be a graph with vertex set V(G) and edge set E(G). For any two vertices x and y in V(G), the distance between x and y, denoted by d(x,y), is the length of the shortest path connecting x and y. The degree of a vertex v in G is the number of neighbors of v in G. Numbers reflecting certain structural features of organic molecules that are obtained from the molecular graph are usually called ...
متن کاملWiener numbers of random pentagonal chains
The Wiener index is the sum of distances between all pairs of vertices in a connected graph. In this paper, explicit expressions for the expected value of the Wiener index of three types of random pentagonal chains (cf. Figure 1) are obtained.
متن کاملThe Polyphenyl Chains with Extremal Edge – Wiener Indices ∗
The edge-Wiener index of a connected graph is the sum of the distances between all pairs of edges of the graph. In this paper, we determine the polyphenyl chains with minimum and maximum edge-Wiener indices among all the polyphenyl chains with h hexagons. Moreover, explicit formulas for the edge-Wiener indices of extremal polyphenyl chains are obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Emerging science journal
سال: 2022
ISSN: ['2610-9182']
DOI: https://doi.org/10.28991/esj-2022-06-01-012