Graphs with regular monoids

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance-Regular Graphs with Strongly Regular Subconstituents

In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which implies that distance-regular graphs with strongly regular subconstituents are precisely the Taylor graphs and graphs with a1 = 0 and ai ∈ {0, 1} for i = 2, . . . , d .

متن کامل

Synchronization 5: Graphs and monoids

From graphs to monoids and back In this section of the notes we describe a pair of maps between graphs on the vertex set Ω and transformation monoids on Ω. These maps do not form a 'Galois correspondence' but have some nice properties relevant to the synchronization project. Since G will always be a group, we use X to denote a graph. From graphs to monoids The map in this direction is simple: t...

متن کامل

Identifying Regular Languages over Partially-Commutative Monoids

We deene a new technique useful in identifying a subclass of regular languages deened on a free partially commutative monoid (regular trace languages), using equivalence and membership queries. Our algorithm extends an algorithm deened by Dana Angluin in 1987 to learn DFA's. The words of a trace language can be seen as equivalence classes of strings. We show how to extract, from a given equival...

متن کامل

Endomorphism monoids of chained graphs

For any complete chain I whose distinct elements are separated by cover pairs, and for every family {Mi | i∈ I} of monoids, we construct a family of graphs {Gi | i∈ I} such that Gi is a proper induced subgraph of Gj for all i; j∈ I with i ¡ j, Gi = ⋂ {Gj | j∈ I; i ¡ j} whenever i = inf{ j∈ I | j¿ i} in I , Gi = ⋃ {Gj | j∈ I; j ¡ i} whenever i = sup{ j∈ I | j¡ i} in I , the endomorphism monoid o...

متن کامل

Strongly Regular Graphs with Parameters . . .

Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m, 2m +m, m +m, m +m). Strongly regular graphs with these parameters have been called max energy graphs, because they have maximal energy (as defined by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2003

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(02)00625-8