一个新的和图和毛虫树

Revista Integración Pub Date : 2022-03-01 DOI:10.18273/revint.v40n1-2022004

N. B. Huamaní, Joice S. do Nascimento, A. Condori

{"title":"一个新的和图和毛虫树","authors":"N. B. Huamaní, Joice S. do Nascimento, A. Condori","doi":"10.18273/revint.v40n1-2022004","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":402331,"journal":{"name":"Revista Integración","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new sum of graphs and caterpillar trees\",\"authors\":\"N. B. Huamaní, Joice S. do Nascimento, A. Condori\",\"doi\":\"10.18273/revint.v40n1-2022004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":402331,\"journal\":{\"name\":\"Revista Integración\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Revista Integración\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18273/revint.v40n1-2022004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Revista Integración","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18273/revint.v40n1-2022004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

毛虫树，或简称毛虫树，是这样的树，当我们移除它们所有的叶子(或末端边缘)时，我们得到一条路径。n≥2条边的非同构毛虫个数为2n−3 + 2⌊(n−3)/2⌋。利用本文引入的一种新的图和，我们给出了这个结果的一个新的证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A new sum of graphs and caterpillar trees

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Revista Integración

自引率

0.00%

发文量