On the Set of 2 - Common Consequent of Primitive Digraphs with Exact <i>d</i>Vertices Having Loop  

作　　者：Xiaogen Chen 

机构地区：[1]School of Computer Science & Engineering, Zhanjiang Normal University, Zhanjiang, China

出　　处：《Applied Mathematics》2012年第12期1959-1962,共4页应用数学（英文）

摘　　要：Let d and n are positive integers, n≥2,1≤d≤ 2.In this paper we obtain that the set of the 2 - common consequent of primitive digraphs of order n with exact d vertices having loop is{1,2,…, n-[]}.Let d and n are positive integers, n≥2,1≤d≤ 2.In this paper we obtain that the set of the 2 - common consequent of primitive digraphs of order n with exact d vertices having loop is{1,2,…, n-[]}.

关 键 词：Boolean Matrix COMMON Consequent PRIMITIVE DIGRAPH 

分 类 号：O1[理学—数学]