A conjecture concerning strongly connected graphs (Q1301281): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5578815 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Spectral Radius of (0,1)-Matrices with 1’s in Prescribed Positions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix Analysis / rank | |||
Normal rank |
Revision as of 21:17, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A conjecture concerning strongly connected graphs |
scientific article |
Statements
A conjecture concerning strongly connected graphs (English)
0 references
9 April 2000
0 references
Let \(G\) be a strongly connected digraph without loops and multiple arcs such that \(G\) has \(n\) vertices and \(d\) arcs. It is shown in the paper that if \(n\leq 5\) and \(d\geq n(n-1)/2+1\) then there is a vertex \(v\) in \(G\) so that \(G-v\) is strongly connected as well. It is conjectured that the statement is true for any \(n\).
0 references
strongly connected digraph
0 references