Number of spanning trees of new join graphs

S. N. Daoud

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.

Full Text: PDF

Published: 2013-07-01

How to Cite this Article:

S. N. Daoud, Number of spanning trees of new join graphs, Algebra Letters, Vol 2013 (2013), Article ID 4

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.

Algebra Letters

ISSN 2051-5502

Editorial Office: office@scik.org

Copyright ©2018 SCIK Publishing Corporation. All rights reserved.