On the existence of noncritical vertices in digraphs
From MaRDI portal
(Redirected from Publication:744557)
Abstract: Let be a strongly connected digraphs on vertices. A vertex of is noncritical, if the digraph is strongly connected. We prove, that if sum of the degrees of any two adjacent vertices of is at least , then there exists a noncritical vertex in , and if sum of the degrees of any two adjacent vertices of is at least , then there exist two noncritical vertices in . A series of examples confirm that these bounds are tight.
Recommendations
Cites work
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- scientific article; zbMATH DE number 867644 (Why is no real title available?)
- On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\)
- On the number of noncritical vertices in strongly connected digraphs
Cited in
(3)
This page was built for publication: On the existence of noncritical vertices in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744557)