Preprint Article Version 1 This version is not peer-reviewed

Complexity of some of Pyramid Graphs Created from a Gear Graph

Version 1 : Received: 8 November 2018 / Approved: 9 November 2018 / Online: 9 November 2018 (15:17:44 UTC)

How to cite: Daoud, S.; Liu, J. Complexity of some of Pyramid Graphs Created from a Gear Graph. Preprints 2018, 2018110248 (doi: 10.20944/preprints201811.0248.v1). Daoud, S.; Liu, J. Complexity of some of Pyramid Graphs Created from a Gear Graph. Preprints 2018, 2018110248 (doi: 10.20944/preprints201811.0248.v1).

Abstract

In mathematics, one always aims to obtain new frameworks from specific ones. This also stratified to the regality of graphs, where one can produce numerous new graphs from a specific set of graphs. In this work we define some classes of pyramid graphs created by a gear graph and we derive straightforward formulas of the complexity of these graphs, using linear algebra matrix analysis techniques and employing knowledges of Chebyshev polynomials.

Subject Areas

Complexity; Chebyshev Polynomials; Gear graph; Pyramid graphs.

Readers' Comments and Ratings (0)

Leave a public comment
Send a private comment to the author(s)
Rate this article
Views 0
Downloads 0
Comments 0
Metrics 0
Leave a public comment

×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.