Article ID Journal Published Year Pages File Type
9513467 Discrete Mathematics 2005 9 Pages PDF
Abstract
In this paper, we deal with the independence number of iterated line digraphs of a regular digraph G. We give pertinent lower bounds and give an asymptotic estimation of the ratio of the number of vertices of a largest independent set of the nth iterated line digraph of G.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Independence number of iterated line digraphs
Authors
,