论文信息 - A Note on the Inverse Problem for the Wiener Index

A Note on the Inverse Problem for the Wiener Index

It was shown recently that all but 49 positive integers are Wiener index of some tree, which had been conjectured by Lepovic and Gutman. In this note we settle the analogous question for unicyclic graphs and also prove that every positive integer which is the Wiener index of some graph (every positive integer other than 2 and 5) is Wiener index of a graph whose cyclomatic number is at most 6. Additional degree restrictions are considered as well.

Stephan Wagner

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

[2] Gang Yu,et al. Molecular graphs and the inverse Wiener index problem , 2009, Discret. Appl. Math..

[3] Lusheng Wang,et al. The Inverse Problems for Some Topological Indices in Combinatorial Chemistry , 2003, J. Comput. Biol..

[4] Yeong-Nan Yeh,et al. The sum of all distances in bipartite graphs , 1995 .

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

[6] Hua Wang,et al. All but 49 Numbers are Wiener Indices of Trees , 2006 .

[7] Stephan Wagner. A Class of Trees and its Wiener Index , 2006 .

[8] Ivan Gutman,et al. A Collective Property of Trees and Chemical Trees , 1998, J. Chem. Inf. Comput. Sci..

[9] Sergey Bereg,et al. A Conjecture on Wiener Indices in Combinatorial Chemistry , 2003, Algorithmica.