Extremal graphs for α-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 V m n = {Pl(Bi) : N(Pl(Bi)) = n;N(Bi) ≥ 2;l ≥ m}. In this paper, we determine the tree that has the larges...
Wedi'i Gadw mewn:
| Cyhoeddwyd yn: | Revista Integración |
|---|---|
| Prif Awduron: | , , , |
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
Universidad Industrial de Santander
2020
|
| Pynciau: | |
| Mynediad Ar-lein: | https://www.redalyc.org/articulo.oa?id=327065446002 https://www.redalyc.org/journal/3270/327065446002/ https://www.redalyc.org/journal/3270/327065446002/html/ https://www.redalyc.org/journal/3270/327065446002/327065446002.epub https://www.redalyc.org/journal/3270/327065446002/movil |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|