Open AccessA new sum of graphs and caterpillar trees
Author(s) -
Nelson Berrocal Huamaní,
Joice Santos do Nascimento,
Alexander Condori
Publication year - 2022
Publication title -
integración/revista integración, temas de matemáticas
Language(s) - English
Resource type - Journals
eISSN - 2145-8472
pISSN - 0120-419X
DOI - 10.18273/revint.v40n1-2022004
Subject(s) - caterpillar , combinatorics , enhanced data rates for gsm evolution , mathematics , path (computing) , tree (set theory) , discrete mathematics , computer science , biology , botany , artificial intelligence , lepidoptera genitalia , programming language
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 2n−3 + 2⌊(n−3)/2⌋. Using a new sum of graphs, introduced in this paper, we provided a new proof of this result.