Combinations as Bargraphs

IF 1 Q1 MATHEMATICS Discrete Mathematics Letters Pub Date : 2022-02-16 DOI:10.47443/dml.2022.0002
T. Mansour, A. S. Shabani
{"title":"Combinations as Bargraphs","authors":"T. Mansour, A. S. Shabani","doi":"10.47443/dml.2022.0002","DOIUrl":null,"url":null,"abstract":"In this paper, we consider statistics on combinations of [n] when combinations are presented as bargraphs. The statistics we consider are cardinality of a combination, semi-perimeter, outer site-perimeter, and inner site-perimeter. We find an explicit formula for the generating function for the number of combinations of [n] according to the considered statistics. We also find an explicit formula for the total of the above statistics over all combinations of [n].","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":"1 1","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2022-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2022.0002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we consider statistics on combinations of [n] when combinations are presented as bargraphs. The statistics we consider are cardinality of a combination, semi-perimeter, outer site-perimeter, and inner site-perimeter. We find an explicit formula for the generating function for the number of combinations of [n] according to the considered statistics. We also find an explicit formula for the total of the above statistics over all combinations of [n].
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
组合为条形图
在本文中,当组合被表示为条形图时,我们考虑[n]的组合的统计量。我们考虑的统计数据是组合的基数、半周长、外站点周长和内站点周长。根据所考虑的统计量,我们找到了[n]组合数的生成函数的一个显式公式。我们还发现了在[n]的所有组合上上述统计的总和的显式公式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Mathematics Letters
Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.50
自引率
12.50%
发文量
47
审稿时长
12 weeks
期刊最新文献
On the permutation cycle structures for almost Moore digraphs of degrees 4 and 5 Atom-bond sum-connectivity index of line graphs General sum-connectivity index and general Randic index of trees with given maximum degree Extremal trees with fixed degree sequence for $\sigma$-irregularity The b$_q$-coloring of graphs
×
引用
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