Table of Contents
ISRN Combinatorics
Volume 2013, Article ID 906756, 5 pages
http://dx.doi.org/10.1155/2013/906756
Research Article

Wiener Index of Graphs with Radius Two

College of Mathematics and System Science, Xinjiang University, Urumqi, Xinjiang 830046, China

Received 20 December 2012; Accepted 21 January 2013

Academic Editors: J. Siemons and B. Taeri

Copyright © 2013 Yin Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. A. Dobrynin, R. Entringer, and I. Gutman, “Wiener index of trees: theory and applications,” Acta Applicandae Mathematicae, vol. 66, no. 3, pp. 211–249, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. M. Aouchiche and P. Hansen, “Automated results and conjectures on average distance in graphs,” in Graph Theory in Paris, Trends in Mathematics, pp. 21–36, Birkhäuser, Basel, Switzerland, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, Calif, USA, 1990. View at MathSciNet
  4. A. Chen and F. Zhang, “Wiener index and perfect matchings in random phenylene chains,” MATCH, vol. 61, no. 3, pp. 623–630, 2009. View at Google Scholar · View at MathSciNet
  5. D. Li, B. Wu, X. Yang, and X. An, “Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts,” Discrete Applied Mathematics, vol. 159, no. 15, pp. 1594–1600, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. S. G. Wagner, “A class of trees and its Wiener index,” Acta Applicandae Mathematicae, vol. 92, pp. 15–20, 2006. View at Google Scholar
  7. S. Wagner, “On the Wiener index of random trees,” Discrete Mathematics, vol. 312, no. 9, pp. 1502–1511, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. B. Wu, “Wiener index of line graphs,” MATCH, vol. 64, no. 3, pp. 699–706, 2010. View at Google Scholar · View at MathSciNet
  9. S. Yamaguchi, “A note on Wiener index,” MATCH, vol. 60, no. 2, pp. 645–648, 2008. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. Z. You and B. Liu, “Note on the minimal Wiener index of connected graphs with n vertices and radius r,” MATCH, vol. 66, no. 1, pp. 343–344, 2011. View at Google Scholar · View at MathSciNet
  11. L. Zhang and B. Wu, “The Nordhaus-Goddum-type inequalities for some chemical indices,” MATCH, vol. 54, no. 1, pp. 189–194, 2005. View at Google Scholar · View at MathSciNet
  12. X.-D. Zhang, Q.-Y. Xiang, L.-Q. Xu, and R.-Y. Pan, “The Wiener index of trees with given degree sequences,” MATCH, vol. 60, no. 2, pp. 623–644, 2008. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. J. Plesník, “On the sum of all distances in a graph or digraph,” Journal of Graph Theory, vol. 8, no. 1, pp. 1–21, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. E. DeLaViña and B. Waller, “Spanning trees with many leaves and average distance,” Electronic Journal of Combinatorics, vol. 15, no. 1, article R33, p. 16, 2008. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. P. Erdős, M. Sakes, and V. T. Sós, “Maximum indueced trees in graphs,” Journal of Combinatorial Theory, Series B, vol. 41, no. 1, pp. 61–79, 1986. View at Google Scholar