{"title":"The number of spanning trees in corona edge product of tree and S-linear chain map","authors":"Fouad Yakoubi, M. E. Marraki, N. E. Khattabi","doi":"10.1109/ICMCS.2016.7905653","DOIUrl":null,"url":null,"abstract":"The number of spanning trees in a graph G is a significant topological invariant of networks. The must known method to compute this number is the Matrix theorem. But this algorithm can not be used in the practical areas, because of its exponential complexity(Θ(n3)), namely for large graphs. that why there is so much interest in obtaining explicit expressions for some graph families. In this paper, we used an efficient method to provide an explicit formulas calculating the number of spanning trees in the corona edge product graph of a tree and S-linear chain.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMCS.2016.7905653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The number of spanning trees in a graph G is a significant topological invariant of networks. The must known method to compute this number is the Matrix theorem. But this algorithm can not be used in the practical areas, because of its exponential complexity(Θ(n3)), namely for large graphs. that why there is so much interest in obtaining explicit expressions for some graph families. In this paper, we used an efficient method to provide an explicit formulas calculating the number of spanning trees in the corona edge product graph of a tree and S-linear chain.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
