On cycles of directed graphs (Q1106238): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01848004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2094535252 / rank | |||
Normal rank |
Latest revision as of 08:35, 30 July 2024
scientific article
In more languages
ConfigureLanguage | Label | Description | Also known as |
---|---|---|---|
English | On cycles of directed graphs |
scientific article |
Statements
Let G be a directed graph, a any fixed vertex of G and b an arbitrary vertex of G. Suppose \(\lambda\) (b) is the number equal to the length of the shortest (simple) path from a to b. The author proves the following: Let G be a directed graph such that (1) the cycles of G have equal length k, (2) every pair of cycles of G has a vertex in common. Then there is an integer i (mod k) such that G has one and only one vertex satisfying \(\lambda (b)=i\).