ON STRICT-DOUBLE-BOUND NUMBERS OF COMPLETE GRAPHS WITHOUT EDGES OF STARS AND PANS

For a poset P = (X, <=(P)), the strict-double-bound graph of P is the graph sDB(P) on V(sDB(P)) = X for which vertices u and v of sDB(P) are adjacent if and only if u not equal v and there exist elements x, y is an element of X distinct from u and v such that x <= u <= p y and x <=(P) V <=(P) y. The strict-double-bound number zeta(G) of a graph G is defined as min{n; sDB(P) congruent to G U (K) over barn for some poset P}. We obtain that zeta(K-n - E(K-m)) = inverted right perpendicular2 root minverted left perpendicular (2 <= m <= n - 1), zeta(K-n - E(K-m-pan)) = inverted right perpendicular2 root m-1inverted left perpendicular+1 (2 <= m <= n - 2), and zeta(K-n - E(K-1,(m))) = 3 (1 <= m <= n - 2).