On link-irregular digraphs
From MaRDI portal
The link of a vertex $u$ in a graph $G$ is the subgraph induced by the neighborhood of $u$, denoted by $L(u)$. $G$ is called link irregular if any two distinct vertices have non-isomorphic links. The authors generalize the probe on link irregular graphs to directed graphs and obtain a characterization for link-irregular digraphs to exist on $n$ vertices. They also derive lower bounds on the minimum degree and out-degree required for link-irregularity. They also raise a conjecture, namely, link-irregular tournaments exist if and only if $n\geq 6$.
Cites work
This page was built for publication: On link-irregular digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232484)
