Skip to content
Algebra Letters ISSN 2051-5502

Archives › Volume 2013 (2013)

Algebra Lett. 2013 (2013), Article ID 4

Number of spanning trees of new join graphs

S. N. Daoud

PDF (424.8 KB)

Abstract

In mathematics, one always tries to get new structures from given ones. This also applies to the realm of graphs, where one can generate many new graphs from a given set of graphs. In this paper we derive simple formulas of the complexity, number of spanning trees, of some new join graphs, using linear algebra, Chebyshev polynomials and matrix analysis techniques.

Published
1 July 2013
Volume
2013 (2013)
License
CC BY 3.0

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.

Cite this article

S. N. Daoud, Number of spanning trees of new join graphs, Algebra Lett. 2013 (2013), 4.

BibTeX
@article{Daoud2013,
  author  = {Daoud, S. N.},
  title   = {Number of spanning trees of new join graphs},
  journal = {Algebra Lett.},
  volume  = {2013},
  year    = {2013},
  pages   = {4},
  doi     = {}
}