Table of Contents
ISRN Algebra
Volume 2011, Article ID 193560, 10 pages
http://dx.doi.org/10.5402/2011/193560
Research Article

Graph Polynomials

Department of Mathematics, Iran University of Science and Technology, Narmak, Tehran 16844, Iran

Received 23 May 2011; Accepted 5 July 2011

Academic Editor: M. Przybylska

Copyright © 2011 Mehdi Alaeiyan and Saeid Mohammadian. 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. D. B. West, Introduction to Graph Theory, Prentice Hall Inc., Upper Saddle River, NJ, USA, 1996.
  2. F. Kuhn and R. Wattenhofer, “Distributed combinatorial optimization,” Tech. Rep. 426, Department of computer Science, ETH Zurich, Zurich, Switzerland, 2003. View at Google Scholar
  3. J. Mihelic and B. Robic, “Solving the k-center problem efficiently with a dominating set,” Algorithm Journal of Computing and Information Technology, vol. 13, no. 3, pp. 225–233, 2005. View at Google Scholar