Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars in Google
Share
Revista Integración
Print version ISSN 0120-419XOn-line version ISSN 2145-8472
Abstract
HUAMANI, N. B.; NASCIMENTO, JOICE S. DO and CONDORI, A.. A new sum of graphs and caterpillar trees. Integración - UIS [online]. 2022, vol.40, n.1, pp.77-85. Epub Aug 24, 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.
MSC2010:
05C30, 05C76, 05C05, 05C60.
Keywords : Graph; Caterpillar trees; tree graphs; sum of graphs.