Computing the Hosoya Index of Catacondensed Hexagonal Systems
The Hosoya index of a graph G is defined as Z (G) = P k≥0 m (G, k), where m (G, k) the number of ways in which k mutually independent edges can be selected in G. In this article we introduce the Hosoya vector of a graph at a given edge. Based on this concept and the recurrence relations known for Z,...
- Autores:
-
Cruz Rodes, Roberto
Marín Arango, Carlos Alberto
Rada Rincón, Juan Pablo
- Tipo de recurso:
- Article of investigation
- Fecha de publicación:
- 2017
- Institución:
- Universidad de Antioquia
- Repositorio:
- Repositorio UdeA
- Idioma:
- eng
- OAI Identifier:
- oai:bibliotecadigital.udea.edu.co:10495/45979
- Acceso en línea:
- https://hdl.handle.net/10495/45979
- Palabra clave:
- Hexagons
Vertex operator algebras
http://id.loc.gov/authorities/subjects/sh85060578
http://id.loc.gov/authorities/subjects/sh88005699
- Rights
- openAccess
- License
- http://creativecommons.org/licenses/by-nc-sa/4.0/
| Summary: | The Hosoya index of a graph G is defined as Z (G) = P k≥0 m (G, k), where m (G, k) the number of ways in which k mutually independent edges can be selected in G. In this article we introduce the Hosoya vector of a graph at a given edge. Based on this concept and the recurrence relations known for Z, we give reduction formulas to compute the Hosoya index of any catacondensed hexagonal system via a product of 4×4 matrices with entries in N. As a consequence, we discuss the extremal value problem of the Hosoya index over certain subsets of the set of cataconsed hexagonal systems. |
|---|