The niche graphs of interval orders

From MaRDI portal
Publication:2450130

DOI10.7151/DMGT.1741zbMATH Open1290.05124arXiv1304.5476OpenAlexW3104587833MaRDI QIDQ2450130FDOQ2450130


Authors: Jeongmi Park, Yoshio Sano Edit this on Wikidata


Publication date: 16 May 2014

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

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 ND+(x)capND+(y)eqemptyset or ND(x)capND(y)eqemptyset, where ND+(x) (resp. ND(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:VomathbbR on the set V and a positive real number deltainmathbbR such that (x,y)inA if and only if f(x)>f(y)+delta. A digraph D=(V,A) is called an interval order if there exists an assignment J of a closed real interval J(x)subsetmathbbR to each vertex xinV such that (x,y)inA if and only if minJ(x)>maxJ(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.


Full work available at URL: https://arxiv.org/abs/1304.5476




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)