Common consequents in directed graphs (Q3695285)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3918406
Language Label Description Also known as
default for all languages
No label defined
    English
    Common consequents in directed graphs
    scientific article; zbMATH DE number 3918406

      Statements

      0 references
      1985
      0 references
      Boolean matrices
      0 references
      path lengths
      0 references
      directed graph
      0 references
      Common consequents in directed graphs (English)
      0 references
      If u and v are two distinct nodes of a directed graph \(G_ n\), let N(u,v) denote the least integer k (if it exists) such that there exists a node w whose distance from u and whose distance from v equals k. The author shows that if N(u,v) exists then N(u,v)\(\leq [(n^ 2+3)/2]-n\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references