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.
Original language | English |
---|---|
Pages (from-to) | 119-123 |
Number of pages | 5 |
Journal | Discrete Mathematics |
Volume | 234 |
Issue number | 1-3 |
DOIs | |
State | Published - 6 May 2001 |
Externally published | Yes |
Bibliographical note
Funding Information:∗Corresponding author. E-mail addresses: [email protected] (R. Aharoni), [email protected] (E. Berger). 1The research was supported by the fund for the promotion of research at the Technion.
Keywords
- Strongly connected digraphs
- Vertex-critical
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics