| dc.creator | Zeen El Deen, Mohamed | |
| dc.date | 2023-03-27 | |
| dc.date.accessioned | 2023-05-11T20:42:07Z | |
| dc.date.available | 2023-05-11T20:42:07Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4664 | |
| dc.identifier | 10.22199/issn.0717-6279-4664 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/225562 | |
| dc.description | In graph theory, a prism over a graph G is the cartesian product of the graph G with P₂. The purpose of this work is to investigate the complexity of the prisms of some path and cycle-related graphs. In particular, we obtain simpler and more explicit formulas for the complexity of a special class of prisms of path-related graphs: fan graph, ladder graph, the composition Pn[P₂] graph, and book graph. Moreover, we obtain straightforward formulas for the complexity of a special class of prisms of cycle-related graphs: wheel graph, gear graph, prism graph, n−crossed prism graph, mirror graph M(Cn) of even cycle Cn, twisted prism, total graph T(Cn) of the cycle Cn, the friendship graph, the flower graph, and planner sunflower graph. These closed formulas are deduced using some basic properties of block matrix, recurrence relation, eigenvalues of circulant matrices, and orthogonal polynomials. | en-US |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Universidad Católica del Norte. | en-US |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4664/4257 | |
| dc.rights | Copyright (c) 2023 Mohamed Zeen El Deen | en-US |
| dc.rights | https://creativecommons.org/licenses/by/4.0 | en-US |
| dc.source | Proyecciones (Antofagasta, On line); Vol. 42 No. 2 (2023); 339-391 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 42 Núm. 2 (2023); 339-391 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2023-02 | |
| dc.subject | complexity | en-US |
| dc.subject | recurrence relation | en-US |
| dc.subject | prism over a graph | en-US |
| dc.subject | Chebyshev polynomials | en-US |
| dc.subject | 05C05 | en-US |
| dc.subject | 05C50 | en-US |
| dc.subject | 05C90 | en-US |
| dc.title | Enumeration of spanning trees in prisms of some graphs | en-US |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Peer-reviewed Article | en-US |
| dc.type | text | en-US |
