The number of edges in critical strongly connected graphs (Q5936056)
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 1612917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of edges in critical strongly connected graphs |
scientific article; zbMATH DE number 1612917 |
Statements
The number of edges in critical strongly connected graphs (English)
0 references
19 June 2002
0 references
A directed graph is called critical strongly connected if it is strongly connected, i.e., each vertex is reachable from every other vertex, and if the removal of any vertex results in a non-strongly connected digraph. It is proved that the maximum number of directed edges in a critical strongly connected digraph on \(n\) vertices (\(n \geq 4\)) is \({n \choose 2} -n+4\).
0 references
strongly connected digraphs
0 references
vertex-critical
0 references
0.8468708395957947
0 references
0.8428323268890381
0 references
0.8304778337478638
0 references
0.823875904083252
0 references
