Extremal graphs for α-index
Fuente:
Redalyc
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artículo científico |
| Lingua: | en |
| Pubblicazione: |
Universidad Industrial de Santander
2020
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1876486818598223872 |
|---|---|
| author | Eber Lenes |
| author_facet | Eber Lenes |
| contents | Extremal graphs for α-index Eber Lenes Henry García Ariel Figueroa Fabian Mercado B. Física, Astronomía y Matemáticas tree index diameter distance Caterpillar 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 largest α-index among all the trees in V m n .MSC2010: 05C50, 05C76, 15A18, 05C12, 05C75. 2020 artículo científico 0120-419X 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 10.18273/revint.v38n1-2020002 en http://www.redalyc.org/revista.oa?id=3270 Revista Integración application/pdf Universidad Industrial de Santander Revista Integración (Colombia) Num.1 Vol.38 |
| format | Artículo científico |
| id | redalyc_327065446002 |
| institution | Redalyc |
| language | en |
| publishDate | 2020 |
| publisher | Universidad Industrial de Santander |
| spellingShingle | Extremal graphs for α-index Eber Lenes Física, Astronomía y Matemáticas tree index diameter distance Caterpillar Extremal graphs for α-index Eber Lenes Henry García Ariel Figueroa Fabian Mercado B. Física, Astronomía y Matemáticas tree index diameter distance Caterpillar 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 largest α-index among all the trees in V m n .MSC2010: 05C50, 05C76, 15A18, 05C12, 05C75. 2020 artículo científico 0120-419X 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 10.18273/revint.v38n1-2020002 en http://www.redalyc.org/revista.oa?id=3270 Revista Integración application/pdf Universidad Industrial de Santander Revista Integración (Colombia) Num.1 Vol.38 |
| title | Extremal graphs for α-index |
| topic | Física, Astronomía y Matemáticas tree index diameter distance Caterpillar |
| url | 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 |