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-[]}.
Highlights
Let V a1, an be a finite set of order n, G V, E be a digraph
Let Gl be a digraph corresponding to the Al, and aiGl a j V ai, a j E Gl, where l > 0 is an integer
We say that a pair of vertices ai, a j, ai a j, has a common consequent c.c. if there is an integer l 0 such that aiGl a jGl
Summary
Let V a1, , an be a finite set of order n , G V , E be a digraph. Elements of V are referred as vertices and those of E as arcs. Let Gl be a digraph corresponding to the Al , and aiGl a j V ai , a j E Gl , where l > 0 is an integer. A digraph G is said to be primitive if there exists a positive integer p such that there is a walk of length p from u to v for all u, v V G .
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
