On the number of caterpillars

Christian Barrientos
{"title":"On the number of caterpillars","authors":"Christian Barrientos","doi":"10.19184/ijc.2022.6.2.1","DOIUrl":null,"url":null,"abstract":"<p style=\"text-align: justify;\">A caterpillar is a tree obtained from a path by attaching pendant vertices. The number of caterpillars of size <em>n</em> is a well-known result. In this work extend this result exploring the number of caterpillars of size <em>n</em> together with the cardinalities of the stable sets and the diameter. Three closed formulas are presented, giving the number of caterpillars of size <em>n</em> with: (i) smaller stable set of cardinality <em>k</em>, (ii) diameter <em>d</em>, and (iii) diameter <em>d</em> and smaller stable set of cardinality <em>k</em>.</p>","PeriodicalId":13506,"journal":{"name":"Indonesian Journal of Combinatorics","volume":"30 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indonesian Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19184/ijc.2022.6.2.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A caterpillar is a tree obtained from a path by attaching pendant vertices. The number of caterpillars of size n is a well-known result. In this work extend this result exploring the number of caterpillars of size n together with the cardinalities of the stable sets and the diameter. Three closed formulas are presented, giving the number of caterpillars of size n with: (i) smaller stable set of cardinality k, (ii) diameter d, and (iii) diameter d and smaller stable set of cardinality k.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
毛毛虫的数量
毛虫是通过附加垂坠顶点从路径中获得的树。大小为n的毛虫的数量是一个众所周知的结果。本文扩展了这一结果,探讨了大小为n的毛虫的数量以及稳定集和直径的基数。给出了三个封闭的公式,给出了大小为n的毛虫的数量:(i)基数k的较小稳定集,(ii)直径d, (iii)基数k的较小稳定集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A note on vertex irregular total labeling of trees On Ramsey (mK2,bPn)-minimal Graphs Local Strong Rainbow Connection Number of Corona Product Between Cycle Graphs Γ-supermagic labeling of products of two cycles with cyclic groups On graphs associated to topological spaces
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1