论文信息 - Cacti with n-vertices and t cycles having extremal Wiener index

Cacti with n-vertices and t cycles having extremal Wiener index

The Wiener index W(G) of a connected graph G is the sum of distances between all pairs of vertices of G. A connected graph G is said to be a cactus if each of its blocks is either a cycle or an edge. Let Gn,t be the set of all n-vertex cacti containing exactly t cycles. Liu and Lu (2007) determined the unique graph in Gn,t with the minimum Wiener index. We now establish a sharp upper bound on the Wiener index of graphs in Gn,t and identify the corresponding extremal graphs.

[1] J. A. Bondy,et al. Graph Theory , 2008, Graduate Texts in Mathematics.

[2] I. Gutman,et al. Wiener Index of Trees: Theory and Applications , 2001 .

[3] Milan Nath,et al. On the distance spectral radius of cacti , 2012 .

[4] Bruce S. Elenbogen,et al. Distance distributions for graphs modeling computer networks , 2007, Discret. Appl. Math..

[5] Dennis H. Rouvray,et al. The Rich Legacy of Half a Century of the Wiener Index , 2002 .

[6] Ľubomír Šoltés,et al. Transmission in graphs: A bound and vertex removing , 1991 .

[7] H. Wiener. Structural determination of paraffin boiling points. , 1947, Journal of the American Chemical Society.

[8] Lihua Feng,et al. On the Wiener index of unicyclic graphs with given girth , 2010, Ars Comb..

[9] I. Gutman,et al. Wiener Index of Hexagonal Systems , 2002 .

[10] I. Gutman,et al. Mathematical Concepts in Organic Chemistry , 1986 .

[11] Frank Harary,et al. Distance in graphs , 1990 .

[12] Huiqing Liu,et al. A Unified Approach to Extremal Cacti for Different Indices , 2008 .

[13] Aleksandra Tepeh,et al. Mathematical aspects of Wiener index , 2015, Ars Math. Contemp..

[14] Kexiang Xu,et al. A Survey on Graphs Extremal with Respect to Distance-Based Topological Indices , 2014 .

[15] Ján Plesník,et al. On the sum of all distances in a graph or digraph , 1984, J. Graph Theory.

[16] Frank Harary,et al. Status and Contrastatus , 1959 .