欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
给定一个无向图G，将G的每条边{x，y}用弧xy或yx替代后得到的有向图称为G的定向图．若连通图G在定向后是强连通的，则称该定向为G的强定向．使得G的所有定向图中强直径最大的定向称为G的最大强直径定向．文章给出了矿圈（其中n≥3）的2顶点扩张图的最大强直径的一个下界．
英文摘要：
With a graph G given, we will obtain the oriented graph of G after replacing each side x,y of G with arc xy or yx. If the connected graph G is strongly connected after the orientation, the orientation is called the strong orientation of G. The orientation of all the oriented graphs of G which makes the strong diameter the largest is also called the maximum strong diameter orientation of G. A lower bound on the maximum strong diameter orientation of 2-vertex multiplication of n-circle（n is not less than 3）is given.
同期刊论文项目
同项目期刊论文
Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-tra
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespa
Online scheduling on batching machines to minimise the total weighted completion time of jobs with p
SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE P
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delive
期刊信息
位置：