论文信息 - Four new sums of graphs and their Wiener indices

Four new sums of graphs and their Wiener indices

The Wiener index is the sum of distances between all vertex pairs in a connected graph. This notion was motivated by various mathematical properties and chemical applications. In this paper we introduce four new operations on graphs and study the Wiener indices of the resulting graphs.

Bijan Taeri | Mehdi Eliasi | M. Eliasi | B. Taeri

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

[2] D. Cvetkovic,et al. Spectra of Graphs: Theory and Applications , 1997 .

[3] Bo-Yin Yang,et al. The behavior of Wiener indices and polynomials of graphs under five graph decorations , 2007, Appl. Math. Lett..

[4] Peter Dankelmann. Average Distance and Independence Number , 1994, Discret. Appl. Math..

[5] Ivan Gutman,et al. On the sum of all distances in composite graphs , 1994, Discret. Math..

[6] I. Gutman,et al. Some recent results in the theory of the Wiener number , 1993 .

[7] D. Cvetkovic,et al. Spectra of graphs : theory and application , 1995 .

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

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

[10] Ingo Althöfer. Average distances in undirected graphs and the removal of vertices , 1990, J. Comb. Theory, Ser. B.

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

[12] Andrey A. Dobrynin. A Simple Formula for the Calculation of the Wiener Index of Hexagonal Chains , 1999, Comput. Chem..