We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/Number of spanning trees of new join graphs
PeriodicalsMathematics

Number of spanning trees of new join graphs

Checking your access to this record.

Abstract & Overview

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.

Cite this record

Salama Nagy Daoud (2013). Number of spanning trees of new join graphs. Algebra Letters, 2013. https://library.shubhaarti.com/content/d667406c-fc87-4ce1-b432-ca77db35c645

Copy in another style

Daoud, S. N. (2013). Number of spanning trees of new join graphs. Algebra Letters, 2013. https://library.shubhaarti.com/content/d667406c-fc87-4ce1-b432-ca77db35c645
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.