The niche graphs of interval orders

Abstract: The niche graph of a digraph

D

is the (simple undirected) graph which has the same vertex set as

D

and has an edge between two distinct vertices

x

and

y

if and only if

N_{D}^{+} (x) c a p N_{D}^{+} (y) e q e m p t y s e t

or

N_{D}^{-} (x) c a p N_{D}^{-} (y) e q e m p t y s e t

, where

N_{D}^{+} (x)

(resp.

N_{D}^{-} (x)

) is the set of out-neighbors (resp. in-neighbors) of

x

in

D

. A digraph

D = (V, A)

is called a semiorder (or a unit interval order) if there exist a real-valued function

f : V o m a t h b b R

on the set

V

and a positive real number

d e l t a i n m a t h b b R

such that

(x, y) i n A

if and only if

f (x) > f (y) + d e l t a

. A digraph

D = (V, A)

is called an interval order if there exists an assignment

J

of a closed real interval

J (x) s u b s e t m a t h b b R

to each vertex

x i n V

such that

(x, y) i n A

if and only if

m i n J (x) > m a x J (y)

. S. -R. Kim and F. S. Roberts characterized the competition graphs of semiorders and interval orders in 2002, and Y. Sano characterized the competition-common enemy graphs of semiorders and interval orders in 2010. In this note, we give characterizations of the niche graphs of semiorders and interval orders.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: The niche graphs of interval orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450130)