Extremal graphs for alpha-index
Let N(G) be the number of vertices of the graph G. Let Pl(Bi) be the tree obtained of the path Pl and the trees B1,B2, ...,Bl by identifying the root vertex of Bi with the i-th vertex of Pl. Let Vmn = {Pl(Bi) : N(Pl(Bi)) =n; N(Bi) ≥ 2; l ≥ m}. In this paper, we determine the tree that has the large...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | Spanish |
| Published: |
Universidad Industrial de Santander
2020-01-01
|
| Series: | Revista Integración |
| Subjects: | |
| Online Access: | https://revistas.uis.edu.co/index.php/revistaintegracion/article/view/10365 |