Resumen

LENES, Eber; GARCIA, Henry; FIGUEROA, Ariel  y  MERCADO B., Fabian. Extremal graphs for α-index. Integración - UIS [online]. 2020, vol.38, n.1, pp.15-31.  Epub 27-Feb-2020. ISSN 0120-419X.  https://doi.org/10.18273/revint.v38n1-2020002.

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.

Palabras clave : Caterpillar; diameter; distance; index; tree..

        · resumen en Español     · texto en Inglés     · Inglés ( pdf )