Counting Spanning Trees in The Ladders

Gujun Wang, Min Xiao, Feng Zhu
{"title":"Counting Spanning Trees in The Ladders","authors":"Gujun Wang, Min Xiao, Feng Zhu","doi":"10.9734/arjom/2023/v19i11761","DOIUrl":null,"url":null,"abstract":"Aims: In order to study the rule of entropy in different graph transformations, this paper introduces and further generalizes the ladder graph from different perspectives, including pinwheel ladders and 3-dimensional ladders. Then the problem of entropy comes down to the calculation of spanning trees in these graphs. Place and Duration of Study: School of Mathematical Sciences, Jiangsu University, between January 2023 and October 2023.  Methodology: A method by seeking similar terms was generalized to help study the essential principle in these graphs. By similarity diagonalization and computer aided calculation, the exact expressions for the number of spanning trees in these graphs are obtained.","PeriodicalId":281529,"journal":{"name":"Asian Research Journal of Mathematics","volume":"39 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asian Research Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9734/arjom/2023/v19i11761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Aims: In order to study the rule of entropy in different graph transformations, this paper introduces and further generalizes the ladder graph from different perspectives, including pinwheel ladders and 3-dimensional ladders. Then the problem of entropy comes down to the calculation of spanning trees in these graphs. Place and Duration of Study: School of Mathematical Sciences, Jiangsu University, between January 2023 and October 2023.  Methodology: A method by seeking similar terms was generalized to help study the essential principle in these graphs. By similarity diagonalization and computer aided calculation, the exact expressions for the number of spanning trees in these graphs are obtained.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
计算梯子中的生成树
目的:为了研究不同图变换中的熵的规律,本文从不同角度介绍并进一步概括了梯形图,包括风车梯形图和三维梯形图。然后,熵的问题归结为这些图中生成树的计算。学习地点和时间:江苏大学数学科学学院,2023 年 1 月至 2023 年 10 月。 研究方法:归纳了一种寻求相似项的方法,以帮助研究这些图中的基本原理。通过相似性对角化和计算机辅助计算,得到了这些图中生成树数的精确表达式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Irredundant and Almost Irredundant Sets in \(\mathbb{M}_2\)(\(\mathbb{C}\)) Modeling HIV-HBV Co-infection Dynamics: Stochastic Differential Equations and Matlab Simulation with Euler-Maruyama Numerical Method Finite-Time Synchronization of Fractional-Order Quaternion-Valued Neural Networks under Aperiodically Intermittent Control: A Non-Separation Method Conditions of Safe Dominating Set in Some Graph Families Correlates of Ghanaian Teachers' Understanding of Mathematics Strands and Cognitive Domains in Basic Education Certificate Examination
×
引用
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