刘新. n连通、k临界有向图的性质[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1991, (1).DOI：
n连通、k临界有向图的性质
摘要
本文研究了n连通、k临界有向图的一些性质
主要结论:每一个临界强连通有向图至少有两个顶点出度为一
同时也至少有两个与之不同的顶点入度为一。本结论加强了[1]中所得到的结论
并用完全不同于[1]的方法证明了对n≥2不存在非完全的n连通、n临界有向图。
Abstract
In this paper two results are given: Every critically strongly connected digraph has at least two vertices of outdegree one
in the same time
has also at least two vertices which are different from the formers with indegree one. This result reinforces the consequence which is give in[1]. As an applica tion
京公网安备11010802024621