Loop and cyclic niche graphs

DOI10.1016/0024-3795(94)00154-6MaRDI QIDQ1805299zbMATH OpenOpenAlexFDO

Authors Charles A. Anderson

Publication date 18 December 1995

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(94)00154-6

zbMATH Keywords

acyclic digraphs cycle digraph loop niche graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Review text

The niche graph of a digraph \(D\) is the graph \(G\) such that an edge \((x, y)\) is in \(G\) if and only if there is a node \(z\) in \(D\) so that either \((x, z)\) and \((y, z)\) or \((z, x)\) and \((z, y)\) are arcs of \(D\). The problem of which graphs were the niche graph of acyclic digraphs have received much attention. The paper considers the effect of relaxing the requirement that the digraph be acyclic. Several new classes of graphs are found to be niche graphs, but many graphs still are neither niche graphs, nor can they be made into niche graphs by adding isolated nodes.

Recommendations

Cites work

Cited in

(12)

This page was built for publication: Loop and cyclic niche graphs

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