Extremal graphs with respect to the total-eccentricity index

نویسندگان

چکیده

In a connected graph G, the distance between two vertices of G is length shortest path these vertices. The eccentricity vertex u in largest and any other G. total-eccentricity index ?(G) sum eccentricities all this paper, we find extremal trees, unicyclic bicyclic graphs with respect to index. Moreover, conjugated trees

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremal Unicyclic and Bicyclic Graphs with Respect to Harary Index

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, we determined the extremal (maximal and minimal) unicyclic and bicyclic graphs with respect to Harary index. 2010 Mathematics Subject Classification: 05C90

متن کامل

Chain hexagonal cacti: extremal with respect to the eccentric connectivity index

In this paper we present explicit formulas for the eccentric connectivity index of three classes of chain hexagonal cacti. Further, it is shown that the extremal chain hexagonal cacti with respect to the eccentric connectivity index belong to one of the considered types. Some open problems and possible directions of further research are mentioned in the concluding section.

متن کامل

Some extremal unicyclic graphs with respect to Hosoya index and Merrifield-Simmons index

The Hosoya index of a graph is defined as the total number of the matchings, including the empty edge set, of the graph. The Merrifield-Simmons index of a graph is defined as the total number of the independent vertex sets, including the empty vertex set, of the graph. Let U(n,∆) be the set of connected unicyclic graphs of order n with maximum degree ∆. We consider the Hosoya indices and the Me...

متن کامل

On extremal trees with respect to the $F$-index

In a study on the structure–dependency of the total π-electron energy from 1972, Trinajstić and one of the present authors have shown that it depends on the sums ∑ v∈V d(v) 2 and ∑ v∈V d(v) , where d(v) is the degree of a vertex v of the underling molecular graph G. The first sum was later named first Zagreb index and over the years became one of the most investigated graph–based molecular stru...

متن کامل

Eccentric Connectivity Index: Extremal Graphs and Values

Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Asian-european Journal of Mathematics

سال: 2023

ISSN: ['1793-7183', '1793-5571']

DOI: https://doi.org/10.1142/s1793557123501383