Table of Contents
International Journal of Combinatorics
Volume 2012, Article ID 780765, 8 pages
http://dx.doi.org/10.1155/2012/780765
Research Article

Algebraic Integers as Chromatic and Domination Roots

1Department of Mathematics, Yazd University, Yazd 89195-741, Iran
2Department of Mathematics, Faculty of Science and Technology, University Malaysia Terengganu, 21030 Kuala Terengganu, Malaysia

Received 19 January 2012; Accepted 7 March 2012

Academic Editor: Xueliang Li

Copyright © 2012 Saeid Alikhani and Roslan Hasni. 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. F. M. Dong, K. M. Koh, and K. L. Teo, Chromatic Polynomials and Chromaticity of Graphs, World Scientific Publishing, 2005. View at Publisher · View at Google Scholar
  2. S. Akbari, S. Alikhani, and Y.-H. Peng, “Characterization of graphs using domination polynomials,” European Journal of Combinatorics, vol. 31, no. 7, pp. 1714–1724, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. S. Alikhani and Y. H. Peng, “Introduction to domination polynomial of a graph,” Ars Combinatoria, In press, http://arxiv.org/abs/0905.2251.
  4. S. Alikhani and Y.-H. Peng, “Dominating sets and domination polynomials of certain graphs—II,” Opuscula Mathematica, vol. 30, no. 1, pp. 37–51, 2010. View at Google Scholar · View at Zentralblatt MATH
  5. S. Alikhani and Y.-H. Peng, “Dominating sets and domination polynomials of paths,” International Journal of Mathematics and Mathematical Sciences, vol. 2009, Article ID 542040, 10 pages, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. S. Alikhani and Y.-H. Peng, “Domination polynomials of cubic graphs of order 10,” Turkish Journal of Mathematics, vol. 35, no. 3, pp. 355–366, 2011. View at Google Scholar
  7. I. Stewart and D. Tall, Algebraic Number Theory, Chapman & Hall, London, UK, 2nd edition, 1987.
  8. B. Jackson, “A zero-free interval for chromatic polynomials of graphs,” Combinatorics, Probability and Computing, vol. 2, no. 3, pp. 325–336, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. W. T. Tutte, “On chromatic polynomials and the golden ratio,” Journal of Combinatorial Theory, vol. 9, pp. 289–296, 1970. View at Google Scholar · View at Zentralblatt MATH
  10. J. Salas and A. D. Sokal, “Transfer matrices and partition-function zeros for antiferromagnetic Potts models—I. General theory and square-lattice chromatic polynomial,” Journal of Statistical Physics, vol. 104, no. 3-4, pp. 609–699, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. S. Alikhani and Y.-H. Peng, “Chromatic zeros and the golden ratio,” Applicable Analysis and Discrete Mathematics, vol. 3, no. 1, pp. 120–122, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. S. Alikhani and Y.-H. Peng, “Chromatic zeros and generalized Fibonacci numbers,” Applicable Analysis and Discrete Mathematics, vol. 3, no. 2, pp. 330–335, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. A. D. Sokal, “Chromatic roots are dense in the whole complex plane,” Combinatorics, Probability and Computing, vol. 13, no. 2, pp. 221–261, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. A. A. Zykov, “On some properties of linear complexes,” Journal of Combinatorial Theory B, vol. 24, no. 66, pp. 163–188, 1949. View at Google Scholar
  15. P. J. Cameron, “Algebraic properties of chromatic roots,” in Proceedings of the 7th Australian and New Zealand Mathematics Convention, Christchurch, New Zealand, December 2008.
  16. A. E. Brouwer, “The number of dominating sets of a finite graph is odd,” preprint.
  17. S. Alikhani, “The domination polynomial of a graph at-1,” Graphs and Combinatorics. In press.
  18. S. Akbari, S. Alikhani, M. R. Oboudi, and Y. H. Peng, “On the zeros of domination polynomial of a graph,” in Combinatorics and Graphs, vol. 531, pp. 109–115, American Mathematical Society, Providence, RI, USA, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  19. R. Frucht and F. Harary, “On the corona of two graphs,” Aequationes Mathematicae, vol. 4, pp. 322–325, 1970. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  20. T. Koshy, Fibonacci and Lucas Numbers with Applications, Wiley-Interscience, 2001.
  21. I. N. Herstein, Topics in Algebra, Xerox College Publishing, 1964.