Table of Contents
International Journal of Combinatorics
Volume 2014 (2014), Article ID 390170, 5 pages
http://dx.doi.org/10.1155/2014/390170
Research Article

Domination Polynomials of k-Tree Related Graphs

Department of Mathematics, Yazd University, Yazd 89195-741, Iran

Received 27 August 2014; Accepted 21 October 2014; Published 11 November 2014

Academic Editor: Johannes Hendrik Hattingh

Copyright © 2014 Somayeh Jahari and Saeid Alikhani. 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. T. W. Haynes, S. T. Hedetniemi, and P. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, NY, USA, 1998. View at MathSciNet
  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 MathSciNet · View at Scopus
  3. S. Alikhani, “The domination polynomial of a graph at 1,” Graphs and Combinatorics, vol. 29, no. 5, pp. 1175–1181, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. T. Kotek, J. Preen, F. Simon, P. Tittmann, and M. Trinks, “Recurrence relations and splitting formulas for the domination polynomial,” Electronic Journal of Combinatorics, vol. 19, no. 3, p. 47, 2012. View at Google Scholar · View at Scopus
  5. M. Walsh, “The hub number of a graph,” International Journal of Mathematics and Computer Science, vol. 1, no. 1, pp. 117–124, 2006. View at Google Scholar · View at MathSciNet
  6. S. Alikhani, “On the domination polynomials of non P4-free graphs,” Iranian Journal of Mathematical Sciences and Informatics, vol. 8, no. 2, pp. 49–55, 2013. View at Google Scholar · View at Scopus
  7. L. Song, W. Staton, and B. Wei, “Independence polynomials of k-tree related graphs,” Discrete Applied Mathematics, vol. 158, no. 8, pp. 943–950, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. 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 of Contemporary Mathematics, pp. 109–115, American Mathematical Society, Providence, RI, USA, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  9. J. I. Brown and J. Tufts, “On the roots of domination polynomials,” Graphs and Combinatorics, vol. 30, no. 3, pp. 527–547, 2014. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. F. Harary and E. M. Palmer, “On acyclic simplicial complexes,” Mathematika, vol. 15, pp. 115–122, 1968. View at Google Scholar · View at MathSciNet
  11. L. W. Beineke and R. E. Pippert, “The number of labeled k-dimensional trees,” Journal of Combinatorial Theory, vol. 6, no. 2, pp. 200–205, 1969. View at Publisher · View at Google Scholar
  12. 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 Publisher · View at Google Scholar · View at MathSciNet
  13. V. E. Levit and E. Mandrescu, “The independence polynomial of a graph at -1,” http://arxiv.org/abs/0904.4819.
  14. 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 · View at MathSciNet · View at Scopus
  15. S. Alikhani, “On the domination polynomial of some graph operations,” ISRN Combinatorics, vol. 2013, Article ID 146595, 3 pages, 2013. View at Publisher · View at Google Scholar