The niche graphs of interval orders
From MaRDI portal
Publication:2450130
DOI10.7151/DMGT.1741zbMATH Open1290.05124arXiv1304.5476OpenAlexW3104587833MaRDI QIDQ2450130FDOQ2450130
Authors: Jeongmi Park, Yoshio Sano
Publication date: 16 May 2014
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Abstract: The niche graph of a digraph is the (simple undirected) graph which has the same vertex set as and has an edge between two distinct vertices and if and only if or , where (resp. ) is the set of out-neighbors (resp. in-neighbors) of in . A digraph is called a semiorder (or a unit interval order) if there exist a real-valued function on the set and a positive real number such that if and only if . A digraph is called an interval order if there exists an assignment of a closed real interval to each vertex such that if and only if . 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
Directed graphs (digraphs), tournaments (05C20) Partial orders, general (06A06) Structural characterization of families of graphs (05C75)
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)