On Chemical Trees That Maximize Atom–Bond Connectivity Index, Its Exponential Version, and Minimize Exponential Geometric–Arithmetic Index

A chemical tree is a tree that has no vertex of degree greater than 4. We denote the set of chemical trees with n vertices as Cn. The ABC index of a chemical tree T is defined as ABC (T) = X 1≤i≤j≤4 mi,j (T) s i + j − 2 ij , where mi,j (T) is the number of edges in T joining vertices of degree i and...

Full description

Autores:
Rada Rincón, Juan Pablo
Cruz Rodes, Roberto
Monsalve Aristizabal, Juan Daniel
Tipo de recurso:
Article of investigation
Fecha de publicación:
2020
Institución:
Universidad de Antioquia
Repositorio:
Repositorio UdeA
Idioma:
eng
OAI Identifier:
oai:bibliotecadigital.udea.edu.co:10495/46414
Acceso en línea:
https://hdl.handle.net/10495/46414
Palabra clave:
Árboles (Teoría de grafos)
Trees (Graph theory)
Álgebra
Algebra
Teoría de conjuntos
Set theory
Rights
openAccess
License
http://creativecommons.org/licenses/by-nc-sa/4.0/