Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 820549, 11 pages
http://dx.doi.org/10.1155/2013/820549
Research Article

On the Complexity of a Class of Pyramid Graphs and Chebyshev Polynomials

1Department of Mathematics, Faculty of Science, Taibah University, Al Madinah 344, Saudi Arabia
2Department of Mathematics, Faculty of Science, Minoufiya University, Shibin El Kom 32511, Egypt

Received 29 April 2013; Revised 26 September 2013; Accepted 2 October 2013

Academic Editor: Xiaojun Wang

Copyright © 2013 S. N. Daoud. 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. G. G. Kirchhoff, “Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der Linearen Verteilung galvanischer Ströme gefürht wird,” Ann. Phys. Chem, vol. 72, pp. 497–508, 1847. View at Google Scholar
  2. A. K. Kelmans and V. M. Chelnokov, “A certain polynomial of a graph and graphs with an extremal number of trees,” Journal of Combinatorial Theory B, vol. 16, pp. 197–214, 1974. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. G. A. Cayley, “A theorm on trees,” Quarterly Journal of Mathematics, vol. 23, pp. 276–378, 1889. View at Google Scholar
  4. L. Clark, “On the enumeration of spanning trees of the complete multipartite graph,” Bulletin of the ICA, vol. 38, pp. 50–60, 2003. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. S. N. Qiao and B. Chen, “The number of spanning trees and chains of graphs,” Journal of Applied Mathematics, vol. 9, pp. 10–16, 2009. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. J. Sedláček, “Lucas numbers in graph theory,” in Mathematics (Geometry and Graph Theory) (Czech), pp. 111–115, Univerzita Karlova, Prague, Czech Republic, 1970. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. J. Sedláček, “On the skeleton of a graph or digraph,” in Combinatorial Structures and Their Applications, R. Guy, M. Hanani, N. Saver, and J. Schonheim, Eds., pp. 387–391, Gordon and Breach, New York, NY, USA, 1970. View at Google Scholar
  8. F. T. Boesch and Z. R. Bogdanowicz, “The number of spanning trees in a Prism,” International Journal of Computer Mathematics, vol. 21, pp. 229–243, 1987. View at Google Scholar
  9. F. T. Boesch and H. Prodinger, “Spanning tree formulas and Chebyshev polynomials,” Graphs and Combinatorics, vol. 2, no. 3, pp. 191–200, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. S. N. Daoud, “Chebyshev polynomials and spanning tree formulas,” International Journal of Mathematical Combinatorics, vol. 4, pp. 68–79, 2013. View at Google Scholar
  11. Y. Zhang, X. Yong, and M. J. Golin, “Chebyshev polynomials and spanning tree formulas for circulant and related graphs,” Discrete Mathematics, vol. 298, no. 1–3, pp. 334–364, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. M. Marcus, A Servy of Matrix Theory and Matrix Inequalities, Allyn and Bacon Inc., Boston, Mass, USA, 1964.