On the minimum abc index of chemical trees

WebFor , if , then Corollary 10 implies that is the unique molecular tree with the minimum harmonic index; if , then Theorem 8 and Lemma 9 imply that is the unique molecular tree with the minimum harmonic index. If , then is not a molecular tree. The following gives the smallest value for with .. Theorem 11. Let and .Then the equality holds if and only if for … WebThe paper outlines the results known for W of trees: methods for computation of W and combinatorial expressions for W for various classes of trees, the isomorphism–discriminating power of W, connections between W and the center and centroid of a tree, as well as between W and the Laplacian eigenvalues, results on the …

Wiener Index of Trees: Theory and Applications SpringerLink

Web9 de jun. de 2024 · Chem. 76 (2016) 131-140] gave rise to a conjecture about the minimum possible ABC-index of trees with a fixed number of leaves. We show that this conjecture … Web13 de abr. de 2010 · Inspired by recent work on the atom-bond connectivity (ABC) index we propose here a new topological index, augmented Zagreb index (AZI). The tight upper … flor heather https://paulkuczynski.com

On structural properties of ABC-minimal chemical trees

Web16 de jul. de 2009 · On the other hand, we strengthen a conjecture of Gutman et al. [Z. Naturforsch. 62a (2007), 495] that the Volkmann trees have maximal Estrada index among the trees with fixed maximum degree Δ, by conjecturing that the Volkmann trees also have maximal even spectral moments of any order. Web19 de set. de 2014 · Furtula et al. [ 12 ], in the first serious mathematical works on ABC index obtained the chemical trees with extremal ABC values. They proved that, among all trees, the star tree, S_n, has the maximal ABC value. Web7 de jan. de 2014 · The cardinalities of V ( G) and E ( G) are called the order and size of G, respectively. The atom-bond connectivity index ( ABC index for short) of G is defined as \begin {aligned} ABC (G) = \sum_ {uv\in E (G)} \sqrt {\frac {d (u)+d (v)-2} {d (u)d (v)}}, \end {aligned} where d ( u) is degree of the vertex u. flor heavy metal

Atom–bond connectivity index of quasi-tree graphs SpringerLink

Category:Augmented Zagreb index SpringerLink

Tags:On the minimum abc index of chemical trees

On the minimum abc index of chemical trees

Experimental method for determining deformation in ABS and …

Web9 de jun. de 2024 · The atom-bond connectivity (ABC) index is a degree-based molecular descriptor with diverse chemical applications. Recent work of Lin et al. [W. Lin, J. Chen, C. Ma, Y. Zhang, J. Chen, D. Zhang, and F. Jia, On trees with minimal ABC index among trees with given number of leaves, MATCH Commun. Math. Comput. Chem. 76 (2016) … WebOn structural properties of ABC-minimal chemical trees Downloadable (with restrictions)! The atom-bond connectivity (ABC) index of a connected graph G is defined as …

On the minimum abc index of chemical trees

Did you know?

Web12 de set. de 2024 · The ABC index plays a key role in correlating the physical–chemical properties and the molecular structures of some families of compounds. In this paper, we … Web1 de ago. de 2014 · The atom-bond connectivity (ABC) index of a connected graph Gis defined as ABC(G)=∑uv∈E(G)d(u)+d(v)−2d(u)d(v),where d(w) is the degree of vertex win Gand E(G) is the set of edges of G. Given greedy trees perturbed by different degree sequences, we investigate the behaviors on their ABC index in this paper.

Web15 de out. de 2024 · In this paper, we significantly refine the known features of the degree sequence of a tree with minimal ABC index. With the refined features a search program … Web25 de set. de 2024 · Let G be a simple, connected and undirected graph. The atom-bond connectivity index (ABC(G)) and Randić index (R(G)) are the two most well known topological indices. Recently, Ali and Du (2024) introduced the difference between atom-bond connectivity and Randić indices, denoted as ABC−R index. In this paper, …

WebIn this paper we further investigate the trees that minimize the ABC index. Our investigations are limited to chemical trees, i.e. trees in which the maximum vertex degree is 4. The … WebThere are several vertex distance-based and degree-based indices which are introduced to analyze the chemical properties of molecule graph, for instance, Wiener index, PI index, Szeged index, and atom-bond connectivity index.

WebOn structural properties of ABC-minimal chemical trees Downloadable (with restrictions)! The atom-bond connectivity (ABC) index of a connected graph G is defined as ABC(G)=∑uv∈E(G)d(u)+d(v)−2d(u)d(v), where d(w) is the degree of vertex w in G and E(G) is the set of edges of G.

Web13 de abr. de 2010 · Abstract Inspired by recent work on the atom-bond connectivity ( ABC) index we propose here a new topological index, augmented Zagreb index ( AZI ). The tight upper and lower bounds for chemical trees are obtained. Moreover, it has been shown that among all trees the star has the minimum AZI value. great stuffing recipes for thanksgivingWeb15 de nov. de 2024 · Experimental method for determining deformation in ABS and ABS-PC plastic when simulated by the method of layer-by-layer fusing and comparison thereof when altering printing conditions: AIP Conference Proceedings: Vol 2171, No 1 No Access Published Online: 15 November 2024 great stuff insulationgreat stuff landscape foamWeb6 de abr. de 2024 · Characterizing trees with minimum ABC-index remained an elusive open problem even after serious attempts and is considered by some as one of the most … great stuff insulating spray foam sealantWeb2 de abr. de 2024 · The ABC index of attains the maximum value if and only if both and are complete graphs. If the ABC index of attains the minimum value, then and must be trees. (2) Let and be trees. Then, the ABC index of attains the maximum value if and only if is a path and is a star. 1. Introduction flor hemiciclicaWeb1 de dez. de 2024 · Given greedy trees perturbed by different degree sequences, we investigate the behaviors on their ABC index in this paper. Moreover, we also give the … flor hemline pearlWeb1 de out. de 2012 · Our algorithm for identifying the minimum-ABC tree(s) consists of two successive steps: (1) Generating the trees using a recursive scheme. (2) Computing the … great stuff logo