Maximum and Minimum Energy Trees with Two and Three Branched Vertices
The energy of a graph G is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. In this paper we find trees with minimal and maximal energy over the sets Ω (n, 2) and Ω (n, 3) of all trees with n vertices and exactly two and three branched vertices, respectively (see...
- Autores:
-
Marín Arango, Carlos Alberto
Rada Rincón, Juan Pablo
Monsalve Aristazábal, Juan Daniel
- Tipo de recurso:
- Article of investigation
- Fecha de publicación:
- 2015
- Institución:
- Universidad de Antioquia
- Repositorio:
- Repositorio UdeA
- Idioma:
- eng
- OAI Identifier:
- oai:bibliotecadigital.udea.edu.co:10495/46930
- Acceso en línea:
- https://hdl.handle.net/10495/46930
- Palabra clave:
- Arboles (teoría de grafos)
Trees (graph theory)
Teoría de grafos
Graph theory
- Rights
- openAccess
- License
- http://creativecommons.org/licenses/by-nc-sa/4.0/