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

摘要

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-[]}.