Funder
China Scholarship Council
National Natural Science Foundation of China
Reference34 articles.
1. Some APX-completeness results for cubic graphs;Alimonti;Theoret. Comput. Sci.,2000
2. Proof verification and the hardness of approximation problems;Arora;J. AMC,1998
3. Graph Theory;Bondy,2008
4. Max-leaves spanning tree is APX-hard for cubic graphs;Bonsma;J. Discrete Algorithms,2012
5. Graphs with maximum connectivity index;Caporossi;Comput. Biol. Chem.,2003
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Extremal Results and Bounds for Atom-Bond Sum-Connectivity Index;Match Communications in Mathematical and in Computer Chemistry;2024