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

HTML  Download Download as PDF (Size: 242KB)  PP. 1959-1962  
DOI: 10.4236/am.2012.312268    2,726 Downloads   4,402 Views  
Author(s)

ABSTRACT

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

Share and Cite:

X. Chen, "On the Set of 2 - Common Consequent of Primitive Digraphs with Exact d Vertices Having Loop," Applied Mathematics, Vol. 3 No. 12, 2012, pp. 1959-1962. doi: 10.4236/am.2012.312268.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.