On cycles of directed graphs (Q1106238)

From MaRDI portal
Revision as of 01:58, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On cycles of directed graphs
scientific article

    Statements

    On cycles of directed graphs (English)
    0 references
    0 references
    1988
    0 references
    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\).
    0 references
    directed graph
    0 references
    cycles
    0 references

    Identifiers