Resumen

HUAMANI, N. B.; NASCIMENTO, JOICE S. DO  y  CONDORI, A.. A new sum of graphs and caterpillar trees. Integración - UIS [online]. 2022, vol.40, n.1, pp.77-85.  Epub 24-Ago-2022. ISSN 0120-419X.  https://doi.org/10.18273/revint.v40n1-2022004.

Caterpillar trees, or simply Caterpillar, are trees such that when we remove all their leaves (or end edge) we obtain a path. The number of nonisomorphic caterpillars with n ≥ 2 edges is 2 n−3 + 2 ⌊(n−3)/2⌋ . Using a new sum of graphs, introduced in this paper, we provided a new proof of this result.

Palabras clave : Graph; Caterpillar trees; tree graphs; sum of graphs.

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