扇形和轮毂中的拟树数

IF 0.7 4区 数学 Q2 MATHEMATICS Electronic Journal of Combinatorics Pub Date : 2023-03-10 DOI:10.37236/11097
C. Merino
{"title":"扇形和轮毂中的拟树数","authors":"C. Merino","doi":"10.37236/11097","DOIUrl":null,"url":null,"abstract":"We extend the classical relation between the $2n$-th Fibonacci number and the number of spanning trees of the $n$-fan graph to ribbon graphs.  More importantly, we establish a relation between the $n$-associated Mersenne number and the number of quasi trees of the $n$-wheel ribbon graph. The calculations are performed by computing the determinant of a matrix associated with ribbon graphs. These theorems are also proven using contraction and deletion in ribbon graphs. The results provide  neat and symmetric combinatorial interpretations of these well-known sequences. Furthermore, they are refined by giving two families of abelian groups whose orders are the  Fibonacci and associated Mersenne numbers.","PeriodicalId":11515,"journal":{"name":"Electronic Journal of Combinatorics","volume":"22 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Number of Quasi-Trees in Fans and Wheels\",\"authors\":\"C. Merino\",\"doi\":\"10.37236/11097\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We extend the classical relation between the $2n$-th Fibonacci number and the number of spanning trees of the $n$-fan graph to ribbon graphs.  More importantly, we establish a relation between the $n$-associated Mersenne number and the number of quasi trees of the $n$-wheel ribbon graph. The calculations are performed by computing the determinant of a matrix associated with ribbon graphs. These theorems are also proven using contraction and deletion in ribbon graphs. The results provide  neat and symmetric combinatorial interpretations of these well-known sequences. Furthermore, they are refined by giving two families of abelian groups whose orders are the  Fibonacci and associated Mersenne numbers.\",\"PeriodicalId\":11515,\"journal\":{\"name\":\"Electronic Journal of Combinatorics\",\"volume\":\"22 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-03-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.37236/11097\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.37236/11097","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

我们将第2n个斐波那契数与n个扇形图的生成树数之间的经典关系推广到带状图。更重要的是,我们建立了n -关联的梅森数与n -轮带状图的拟树数之间的关系。计算通过计算与带状图相关联的矩阵的行列式来执行。这些定理也用带状图中的收缩和删除来证明。结果为这些众所周知的序列提供了整齐和对称的组合解释。此外,通过给出两个阿贝尔群族,它们的顺序是斐波那契数和相关的梅森数,对它们进行了改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The Number of Quasi-Trees in Fans and Wheels
We extend the classical relation between the $2n$-th Fibonacci number and the number of spanning trees of the $n$-fan graph to ribbon graphs.  More importantly, we establish a relation between the $n$-associated Mersenne number and the number of quasi trees of the $n$-wheel ribbon graph. The calculations are performed by computing the determinant of a matrix associated with ribbon graphs. These theorems are also proven using contraction and deletion in ribbon graphs. The results provide  neat and symmetric combinatorial interpretations of these well-known sequences. Furthermore, they are refined by giving two families of abelian groups whose orders are the  Fibonacci and associated Mersenne numbers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.30
自引率
14.30%
发文量
212
审稿时长
3-6 weeks
期刊介绍: The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.
期刊最新文献
Three New Refined Arnold Families On Sequences Without Short Zero-Sum Subsequences Weak Degeneracy of Planar Graphs and Locally Planar Graphs Generalized Heawood Numbers The Degree and Codegree Threshold for Linear Triangle Covering in 3-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