Article ID Journal Published Year Pages File Type
4648363 Discrete Mathematics 2009 8 Pages PDF
Abstract

A digraph is arc-locally in-semicomplete if for any pair of adjacent vertices x,yx,y, every in-neighbor of xx and every in-neighbor of yy either are adjacent or are the same vertex. In this paper, we study the structure of strong arc-locally in-semicomplete digraphs and prove that a strong arc-locally in-semicomplete digraph is either arc-locally semicomplete or in a special class of digraphs. Using this structural characterization, we show that a 2-strong arc-locally in-semicomplete digraph is arc-locally semicomplete and a conjecture of Bang-Jensen is true.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,