The optimization problem of constructing a K-edge-connected directed graph from any given directed graph by adding a minimum set of edges is studied.

本文研究了以最小边集扩充一个任意有向图为K边连通有向图这一优化问题。

youdao

The generative rule of arbitrary N-rank K-regular simple graph is studied, and the method of recursively generating arbitrary N-rank K-regular graph from the simple complete graph is put forward.

研究了任意N阶k正则简单图的生成法则，提出了由简单完全图递归生成任意N阶k正则图的方法。

youdao

We determine in this paper the treewidth of the product of a tree and a k-connected partial k-tree, where a partial k-tree is a graph with treewidth k.

本文确定了一棵树与一个k -连通偏k -树的乘积图的树宽。其中，偏k -树是一个树宽为k的图。

youdao