On the minimum abc index of chemical trees
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 … 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.
On the minimum abc index of chemical trees
Did you know?
Web1 de jul. de 2004 · We report here the results of the search for pairs of equienergetic acyclic molecular graphs (chemical trees) with the same number n of vertices. There are very … 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.
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) … Web1 de mai. de 2024 · The atom-bond connectivity ( ABC) index provides a good model for the stability of linear and branched alkanes as well as the strain energy of cycloalkanes. For certain physico-chemical properties, the predictive power of GA index is somewhat better than predictive power of the Randić connectivity index. In this paper, we have studied the
Web1 de dez. de 2024 · In this paper, we present an efficient approach of computing trees with minimal ABC index, by considering the degree sequences of trees and some known … Web6 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 …
Web1 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 …
Web6 de jun. de 2010 · The lower and upper bounds on ABC index of chemical trees in terms of the number of vertices were obtained in [3]. Also, it has been shown that the star K 1, n − 1, has the maximal ABC value of trees. sol bambouWeb1 de set. de 2024 · Minimal values of VDB topological indices of chemical trees Let φ be a VDB topological index induced by the numbers {φ ( i, j )} (i,j) ∈ K and defined as (1). Since we are only interested in chemical trees, we may assume that K = { ( i, j) ∈ N × N: 1 ≤ i … sol barber and ink academyWeb4 de fev. de 2024 · Abstract. For a graph , its sum-connectivity index is denoted by and is defined as the sum of the numbers over all edges of , where denotes the degree of a vertex . In this study, we find a sharp lower bound on the sum-connectivity index of graphs having minimum degree of at least 3 under certain constraints and characterize the … slytherin scarf indiaWebLemma 1. Let and be positive integers such that . If is a tree such that is minimum among all the trees of , then contains at most one pendent path of length greater than 1.. Proof. Suppose, contrarily, that and are two pendent paths in , where and (note that the vertices and may coincide). If , then , and we have a contradiction to the choice of . Lemma 1 … sol barber school on jefferson dallas txWeb1 de out. de 2012 · The ABC index is a degree-based molecular structure descriptor, that found chemical applications. Finding the connected graph(s) of a given order whose ABC … slytherin scarf tumblrWebThere 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. sol barbacan hotelWebOn 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. sol barbacan reviews