No label defined (Q4722089)

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 3993611
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3993611

      Statements

      1985
      0 references
      pancyclicity
      0 references
      strongly connected digraph
      0 references
      0 references
      Let \(G\) be a strongly connected digraph with n verticed satisfying the condition that the sum of degrees for any two distinct nonadjacent vertices is at least \(2n-1\). Then either (1) \(G\) is pancyclic; or (2) n is even and \(G\in \{\vec K_{n/2,n/2}\); \(\vec K_{n/2,n/2}\setminus \{e\}\}\), where \(e\in E(\vec K_{n/2,n/2})\), or (3) \(G\in \Phi^ m_ n\), where \(n-1\geq m>(n+1)/2\) and \(\Phi^ m_ n\) is the family of digraphs \(G'\), which satisfies the following conditions: (a) \(V(G')=\{x_ 1,x_ 2,...,x_ n\};\) (b) for each \(i\in [1,n-m+1]\) the vertices \(x_ i\) and \(x_{i+m-1}\) are nonadjacent; (c) \(x_ 1,x_ n\in E(G')\) and \(x_{i+1}x_ i\in E(G')\) for each \(i\in [1,n-1];\) (d) if \(2\leq i+1<j\leq n\), then \(x_ jx_ i\in E(G');\) (e) the sum of degrees for any two distinct nonadjacent vertices is at least \(2n-1\).
      0 references

      Identifiers