On a Class of Extremal Trees for Various Indices
نویسنده
چکیده
It was recently shown that an interesting class of trees maximizes the MerrifieldSimmons index and minimizes the Hosoya index and energy among all trees with given number of vertices and maximum degree. In this paper, we describe how these trees (which we will call F-trees) can be constructed algorithmically by means of so-called F-expansions, which are very similar to ordinary base-d digital expansions. Our algorithms are illustrated by various examples. Furthermore, some more properties of F-trees are described and numerical data is provided.
منابع مشابه
On the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کاملBond Additive Modeling 5. Mathematical Properties of the Variable Sum Exdeg Index
Recently, discrete and variable Adriatic indices have been introduced and it has been shown that the sum α -exdeg index is good predictor (when variable parameter is equal to 0.37 ) of the octanol-water partition coefficient for octane isomers. Here, we study mathematical properties of this descriptor. Namely, we analyze extremal graphs of this descriptor in the following classes: the class of ...
متن کاملLeap Zagreb indices of trees and unicyclic graphs
By d(v|G) and d_2(v|G) are denoted the number of first and second neighborsof the vertex v of the graph G. The first, second, and third leap Zagreb indicesof G are defined asLM_1(G) = sum_{v in V(G)} d_2(v|G)^2, LM_2(G) = sum_{uv in E(G)} d_2(u|G) d_2(v|G),and LM_3(G) = sum_{v in V(G)} d(v|G) d_2(v|G), respectively. In this paper, we generalizethe results of Naji et al. [Commun. Combin. Optim. ...
متن کاملVariable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees
Chemical graphs, as other ones, are regular if all their vertices have the same degree. Otherwise, they are irregular, and it is of interest to measure their irregularity both for descriptive purposes and for QSAR/QSPR studies. Three indices have been proposed in the literature for that purpose: those of Collatz-Sinogowitz, of Albertson, and of Bell's variance of degrees. We study their propert...
متن کاملDistance-based Graph Invariants of Trees and the Harary Index
Introduced in 1947, the Wiener index W (T ) = ∑ {u,v}⊆V (T ) d(u, v) is one of the most thoroughly studied chemical indices. The extremal structures (in particular, trees with various constraints) that maximize or minimize the Wiener index have been extensively investigated. The Harary index H(T ) = ∑ {u,v}⊆V (T ) 1 d(u,v) , introduced in 1993, can be considered as the “reciprocal analogue” of ...
متن کامل