On a generalization of transitivity for digraphs

A. Gyárfás, Michael S. Jacobson, Lael F. Kinch

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper we investigate the following generalization of transitivity: A digraph D is (m,n)-transitive whenever there is a path of length m from x to y there is a subset of n+1 vertices of these m+1 vertices which contain a path of length n from x to y. Here we study various properties of (m,n)-transitive digraphs. In particular, (m,1)-transitive tournaments are characterized. Their similarities to transitive tournaments are analyzed and discussed. Various other results pertaining to (m,1)-transitive digraphs are given.

Original languageEnglish
Pages (from-to)35-41
Number of pages7
JournalDiscrete Mathematics
Volume69
Issue number1
DOIs
Publication statusPublished - 1988

Fingerprint

Transitivity
Digraph
Tournament
Path
Generalization
Subset

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

On a generalization of transitivity for digraphs. / Gyárfás, A.; Jacobson, Michael S.; Kinch, Lael F.

In: Discrete Mathematics, Vol. 69, No. 1, 1988, p. 35-41.

Research output: Contribution to journalArticle

Gyárfás, A. ; Jacobson, Michael S. ; Kinch, Lael F. / On a generalization of transitivity for digraphs. In: Discrete Mathematics. 1988 ; Vol. 69, No. 1. pp. 35-41.
@article{d49fdb9f0b10494088c9a511b4d05210,
title = "On a generalization of transitivity for digraphs",
abstract = "In this paper we investigate the following generalization of transitivity: A digraph D is (m,n)-transitive whenever there is a path of length m from x to y there is a subset of n+1 vertices of these m+1 vertices which contain a path of length n from x to y. Here we study various properties of (m,n)-transitive digraphs. In particular, (m,1)-transitive tournaments are characterized. Their similarities to transitive tournaments are analyzed and discussed. Various other results pertaining to (m,1)-transitive digraphs are given.",
author = "A. Gy{\'a}rf{\'a}s and Jacobson, {Michael S.} and Kinch, {Lael F.}",
year = "1988",
doi = "10.1016/0012-365X(88)90175-6",
language = "English",
volume = "69",
pages = "35--41",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - On a generalization of transitivity for digraphs

AU - Gyárfás, A.

AU - Jacobson, Michael S.

AU - Kinch, Lael F.

PY - 1988

Y1 - 1988

N2 - In this paper we investigate the following generalization of transitivity: A digraph D is (m,n)-transitive whenever there is a path of length m from x to y there is a subset of n+1 vertices of these m+1 vertices which contain a path of length n from x to y. Here we study various properties of (m,n)-transitive digraphs. In particular, (m,1)-transitive tournaments are characterized. Their similarities to transitive tournaments are analyzed and discussed. Various other results pertaining to (m,1)-transitive digraphs are given.

AB - In this paper we investigate the following generalization of transitivity: A digraph D is (m,n)-transitive whenever there is a path of length m from x to y there is a subset of n+1 vertices of these m+1 vertices which contain a path of length n from x to y. Here we study various properties of (m,n)-transitive digraphs. In particular, (m,1)-transitive tournaments are characterized. Their similarities to transitive tournaments are analyzed and discussed. Various other results pertaining to (m,1)-transitive digraphs are given.

UR - http://www.scopus.com/inward/record.url?scp=45449121842&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=45449121842&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(88)90175-6

DO - 10.1016/0012-365X(88)90175-6

M3 - Article

AN - SCOPUS:45449121842

VL - 69

SP - 35

EP - 41

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -