We study the Steiner k-eccentricity on trees, which generalizes previous one in paper [On average 3-eccentricity of arXiv:2005.10319]. achieve much stronger properties for k-ecc tree than that paper. Based this, a linear time algorithm is devised to calculate vertex tree. On other hand, lower and upper bounds index order n are established based novel technique quite different also easier follow...

The augmented eccentric connectivity index is defined as the summation of the quotients of the product of adjacent vertex degrees and eccentricity of the concerned vertex of a graph which is a generalization of eccentric connectivity index. In this paper we present explicit expressions for the values of augmented eccentric connectivity indices of some particular thorn graphs like thorn path, th...

The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.

Topological indices (TIs) assign a numeric value to graph or molecular structure. Due their ability predict the physiochemical properties of graph, several TIs have been introduced and studied, mainly based on degree distance. For vertex v , maximum distance id="M2">v from any other in id="M3">G</m...

Eccentric distance sum (EDS), which can predict biological and physical properties, is a topological index based on the eccentricity of a graph. In this paper we characterize the chain hexagonal cactus with the minimal and the maximal eccentric distance sum among all chain hexagonal cacti of length n, respectively. Moreover, we present exact formulas for EDS of two types of hexagonal cacti.

In this study, the effective parameters on the inelastic response of asymmetric buildings is evaluated for an ensemble of real Iranian earthquake records by considering soil-structure interaction. Then, the design eccentricity obtained from the inelastic dynamic soil-structure analysis is compared with the design eccentricity of seisimic codes of Iran, ATC-3, New Zeland, Canada, Mexico, Austral...

If G is a connected graph with vertex set V (G), then the eccentric connectivity index of G, denoted by ξc(G), is defined as ∑ v∈V (G) deg(v)ec(v), where deg(v) is the degree of a vertex v and ec(v) is its eccentricity. Morgan et al. [5] investigated the eccentric connectivity index of trees. In this paper, we investigate the eccentric connectivity index of unicyclic graphs. Upper bound is obta...