On Minimal Prime Graphs and Posets

نویسندگان
چکیده

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

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

منابع مشابه

On Minimal Prime Graphs and Posets

We show that there are four infinite prime graphs such that every infinite prime graph with no infinite clique embeds one of these graphs. We derive a similar result for infinite prime posets with no infinite chain or no infinite antichain.

متن کامل

A note on 3-Prime cordial graphs

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

متن کامل

Isoparametric Problems on Graphs and Posets Isoparametric Problems on Graphs and Posets

We consider extremal graph-theoretic problems on regular structures. The problems ask to maximize a certain parameter of the structures in question under the condition that the values of some other parameter(s) are constant. This is where the term isoparametric is taken from. The graph problems we consider are edge-isoperimetric problems, and the poset problems are dealing with the notion of Ma...

متن کامل

Posets and planar graphs

Usually dimension should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value 1⁄2 t 1l t , thought to be between t 1 and t. We have the following two results: (a) a graph is outerplanar if and only if its dimension is at most 1⁄22l3 . This characterization of outerplanar graphs is closely related to the celebrated result of W. Schnyder...

متن کامل

Some theorems on graphs and posets

Lcclerc proved that the dimension of the partiailly ordered slet consisting of all subf~ce'~ of a tree T, m&red by inclusion, is the number of end yuints of 'I'. Leclerc posed the probkrn of determitAng the dimension the partially ed set P consisting of all inducxxI connected subgraphs of a connec graph G for tPisa lattice. In this paper, WC prove that the poset P consisting af all induced conn...

متن کامل

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


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

ژورنال

عنوان ژورنال: Order

سال: 2009

ISSN: 0167-8094,1572-9273

DOI: 10.1007/s11083-009-9131-y