A uniquely pancyclic digraph is a digraph which has exactly one directed cycle of each length l , for 3 l v , where v is the number of vertices of the digraph 一个唯一泛圈有向图是一个定向图,且对3 l v的每个l ,它恰好有一个长为l的有向圈,这里的v表示有向图的顶点数。
This thesis contributes to directed cycles in digraphs , including the relations between the girth g ( d ) ( length of the shortest directed cycle ) of d and degrees of vertices of d and between the shortest directed cycle of d and the binding number of d , among which vertex - transitive digraphs are studied in detail 本篇论文主要研究有向图中的有向圈,讨论有向图中的围长g ( d ) (最短有向圈的长度)与图的顶点度以及结合数之间的关系,并重点分析了点可迁图类。