Title of article
The number of edges in critical strongly connected graphs
Author/Authors
Ron Aharoni، نويسنده , , Eli Berger، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
5
From page
119
To page
123
Abstract
We prove that the maximal number of directed edges in a vertex-critical strongly connected simple digraph on n vertices is (n2)−n+4.
Keywords
Strongly connected digraphs , Vertex-critical
Journal title
Discrete Mathematics
Serial Year
2001
Journal title
Discrete Mathematics
Record number
949672
Link To Document