Enumeration of the Number of Spanning Trees of the Globe Network and its Subdivision

IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Ad Hoc & Sensor Wireless Networks Pub Date : 2023-09-28 DOI:10.5121/jgraphoc.2023.15301
Basma Mohamed, Mohamed Amin
{"title":"Enumeration of the Number of Spanning Trees of the Globe Network and its Subdivision","authors":"Basma Mohamed, Mohamed Amin","doi":"10.5121/jgraphoc.2023.15301","DOIUrl":null,"url":null,"abstract":"The complexity of a graph can be determined using a network-theoretic method, which is given. This strategy is based on the connection between graph theory and the theory of determinants in linear algebra. In this article, we provide a unique algebraic method that makes use of linear algebra to derive simple formulas for the complexity of diverse novel networks. We can derive the explicit formulas for the globe network and its subdivision using this method. In the final least, we also determine their spanning trees entropy and compare it to each other","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc & Sensor Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/jgraphoc.2023.15301","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The complexity of a graph can be determined using a network-theoretic method, which is given. This strategy is based on the connection between graph theory and the theory of determinants in linear algebra. In this article, we provide a unique algebraic method that makes use of linear algebra to derive simple formulas for the complexity of diverse novel networks. We can derive the explicit formulas for the globe network and its subdivision using this method. In the final least, we also determine their spanning trees entropy and compare it to each other
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
全球网络生成树数目的枚举及其细分
图的复杂度可以用网络理论的方法来确定。这种策略是基于图论与线性代数中行列式理论之间的联系。在本文中,我们提供了一种独特的代数方法,利用线性代数推导出各种新型网络复杂性的简单公式。利用这种方法可以推导出全球网及其细分的显式公式。最后,我们还确定了它们的生成树熵,并将其相互比较
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Ad Hoc & Sensor Wireless Networks
Ad Hoc & Sensor Wireless Networks 工程技术-电信学
CiteScore
2.00
自引率
44.40%
发文量
0
审稿时长
8 months
期刊介绍: Ad Hoc & Sensor Wireless Networks seeks to provide an opportunity for researchers from computer science, engineering and mathematical backgrounds to disseminate and exchange knowledge in the rapidly emerging field of ad hoc and sensor wireless networks. It will comprehensively cover physical, data-link, network and transport layers, as well as application, security, simulation and power management issues in sensor, local area, satellite, vehicular, personal, and mobile ad hoc networks.
期刊最新文献
Enumeration of the Number of Spanning Trees of the Globe Network and its Subdivision A HYBRID OPTIMIZATION ALGORITHMS FOR SOLVING METRIC DIMENSION PROBLEM Detecting Malicious Use of DoH Tunnels Using Statistical Traffic Analysis RPL+: An Improved Parent Selection Strategy for RPL in Wireless Smart Grid Networks Prototype of deployment of Federated Learning with IoT devices
×
引用
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