Complexity of Join and Corona graphs and Chebyshev polynomials

S. N. Daoud

doi:10.1080/16583655.2018.1502486

Back

Complexity of Join and Corona graphs and Chebyshev polynomials

Journal article

Open access

Peer reviewed

Complexity of Join and Corona graphs and Chebyshev polynomials

S. N. Daoud

Journal of Taibah University for Science, Vol.12(5), pp.557-572

03/09/2018

DOI: https://doi.org/10.1080/16583655.2018.1502486

Abstract

Chebyshev polynomials

Corona

Join

Number of spanning trees

Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs. In this paper, we extend this idea for some operations on graphs such as, Join and Corona of two graphs and , if and are one of the following graphs: (i) Path graph , (ii) Cycle graph , (iii) Complete graph , (iv) Complete bipartite , (v) Hypercube graph , (vi) Fan graph and (vi) Wheel graph .

Files and links (1)

url

https://doi.org/10.1080/16583655.2018.1502486View

Published (Version of record) Open

Metrics

1 Record Views

Details

Title: Complexity of Join and Corona graphs and Chebyshev polynomials
Creators - without role: S. N. Daoud - Taibah University
Publication Details: Journal of Taibah University for Science, Vol.12(5), pp.557-572
Publisher: Taylor & Francis
Grant note: 1439 / Taibah University (10.13039/501100002403)
Identifiers: 9929615608331
Academic Unit: Taibah University
Language: English
Resource Type: Journal article