Title of article
Path-connectivity in local tournaments Original Research Article
Author/Authors
A digraph T is called a local tournament if for every vertex x of T، نويسنده , , the set of in-neighbors as well as the set of out-neighbors of x induce tournaments. We give characterizations of generalized arc-pancyclic and strongly path-panconnected local tournaments، نويسنده , , respectively. Our results generalize those due to Bu and Zhang (1996) about arc-pancyclic local tournaments and about strongly arc-pancyclic local tournaments، نويسنده , , respectively. Moreover، نويسنده , , these also extend the corresponding results in Tian et al. (1982) and Zhang (1982) for tournaments.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
20
From page
353
To page
372
Abstract
Yubao Guo
Journal title
Discrete Mathematics
Serial Year
1997
Journal title
Discrete Mathematics
Record number
951792
Link To Document