A Method for Geodesic Distance on Subdivision of Trees With Arbitrary Orders and Their Applications

IEEE Transactions on Knowledge and Data Engineering(2022)

引用 13|浏览21
暂无评分
摘要
Geodesic distance, sometimes called shortest path length, has proven useful in a great variety of applications, such as information retrieval on networks including treelike networked models. Here, our goal is to analytically determine the exact solutions to geodesic distances on two different families of growth trees which are recursively created upon an arbitrary tree 更多
查看译文
关键词
Complex networks,Fractals,Analytical models,Closed-form solutions,Graph theory,Predator prey systems,Mathematical model
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要