The m-competition indices of symmetric primitive digraphs with loop
نویسندگان
چکیده
منابع مشابه
Ela the M-competition Indices of Symmetric Primitive Digraphs without Loops
Abstract. For positive integers m and n with 1 ≤ m ≤ n, the m-competition index (generalized competition index) of a primitive digraph D of order n is the smallest positive integer k such that for every pair of vertices x and y in D, there exist m distinct vertices v1, v2, . . . , vm such that there exist walks of length k from x to vi and from y to vi for each i = 1, . . . , m. In this paper, ...
متن کاملA Characterization of Graphs with Interval Two-Step Graphs
Dedicated by the other authors to Professor John Maybee on the occasion of his 65th birthday. Abstract. One of the intriguing open problems on competition graphs is determining what digraphs have interval competition graphs. This problem originated in the work of Cohen 5, 6] on food webs. In this paper we consider this problem for the class of loopless symmetric digraphs. The competition graph ...
متن کاملFlag-transitive Point-primitive symmetric designs and three dimensional projective special linear groups
The main aim of this article is to study (v,k,λ)-symmetric designs admitting a flag-transitive and point-primitive automorphism group G whose socle is PSL(3,q). We indeed show that the only possible design satisfying these conditions is a Desarguesian projective plane PG(2,q) and G > PSL(3,q).
متن کاملPrimitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs
Article history: Received 3 June 2010 Accepted 2 November 2010 Available online 26 November 2010 Submitted by R.A. Brualdi AMS classification: 05C50 15A09 15A48
متن کاملWell primitive digraphs
A primitive digraph D is said to be well primitive if the local exponents of D are all equal. In this paper we consider well primitive digraphs of two special types: digraphs that contain loops, and symmetric digraphs with shortest odd cycle of length r. We show that the upper bound of the exponent of the well primitive digraph is n− 1 in both these classes of digraphs, and we characterize the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 108 شماره
صفحات -
تاریخ انتشار 2013