We give tight upper and lower bounds for the additive degree-Kirchhoff index of a connected undirected graph.
科研之友
微信
新浪微博
Facebook
分享链接
