A digraph is called oriented if there is at most one arc between two distinct vertices. We call an oriented graph D is nonsingular if its adjacency matrix is nonsingular. In this paper, we characte...

中文翻译：

---

有向三环图的奇异性


如果两个不同顶点之间至多有一条弧，则称有向图为有向图。如果有向图 D 的邻接矩阵是非奇异的，我们称它是非奇异的。在本文中，我们描述了...