2 research outputs found
A new sum of graphs and caterpillar trees
Ărboles oruga, o simplemente oruga, son ĂĄrboles tales que cuandoles quitamos todas sus ramas (o arista final) obtenemos un camino. La cantidad de orugas no isomorfas con n â„ 2 aristas es 2nâ3 + 2â(nâ3)/2â. Usandouna nueva suma de grafos, introducida en este artĂculo, proporcionamos unanueva prueba de este resultado.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