1) k-power graph of path
路的k次主图
2) the kth power of graph
k次方图
1.
There are four chapters in this dissertation, which focuses on three subjects:the wide diameter of the kth power of paths and trees, and obtaining the boundof the wide diameter of the kth power of graphs; the wide diameter the kth powerof cycles and getting the bound of the kth power of hamiltonian graphs; the widediameter of the Harary graphs.
本文共四章，主要研究了三方面的内容：路和树的k次方图的宽直径，并得到图的k次方图的宽直径的界；圈的k次方图的宽直径及给出了含圈图的k次方图的宽直径的界；Harary图的宽直径。
3) quartic form of a graph.k-factor
图的四次型K-因子
4) k-path graph
k-路图
5) k shortest paths
k次短路径
1.
k shortest paths include the shortest one,the second shortest one,the third shortest one,and soon.
分析了前k条最短路径的图论理论基础,在计算出最短路径的基础上,提出了一种基于前k-1条最短路径的k次短路径的求解方法,该方法能方便高效地找出次短路、再次短路,一直到k次短路。
6) K-Walks of Graphs
图的K-walk
补充资料：次主
1.犹主次。指尊卑先后的顺序。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条