{"title":"全球网络生成树数目的枚举及其细分","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":"67 1","pages":"0"},"PeriodicalIF":0.6000,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":\"67 1\",\"pages\":\"0\"},\"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}","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}
Enumeration of the Number of Spanning Trees of the Globe Network and its Subdivision
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
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
