The Complexity of Spanning Tree Problems Involving Graphical Indices.
Discrete Applied Mathematics(2024)
摘要
We consider the computational complexity of spanning tree problems involving the graphical function-index. This index was recently introduced by Li and Peng as a unification of a long list of chemical and topological indices. We present a number of unified approaches to determine the NP-completeness and APX-completeness of maximum and minimum spanning tree problems involving this index. We give many examples of well-studied topological indices for which the associated complexity questions are covered by our results.
更多查看译文
关键词
Graphical function-index,Spanning tree,NP-complete,APX-complete
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要