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 CET)

A peer-reviewed article of this Preprint also exists.

Liu, J.-B.; Daoud, S.N. The Complexity of Some Classes of Pyramid Graphs Created from a Gear Graph. Symmetry 2018, 10, 689. Liu, J.-B.; Daoud, S.N. The Complexity of Some Classes of Pyramid Graphs Created from a Gear Graph. Symmetry 2018, 10, 689.

Journal reference: Symmetry 2018, 10, 689
DOI: 10.3390/sym10120689

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.

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

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


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