The number of edges in critical strongly connected graphs

Ron Aharoni; Eli Berger

doi:10.1016/S0012-365X(00)00395-2

The number of edges in critical strongly connected graphs

Ron Aharoni
, Eli Berger

Research output: Contribution to journal › Article › peer-review

Abstract

We prove that the maximal number of directed edges in a vertex-critical strongly connected simple digraph on n vertices is (ⁿ₂) - n + 4.

Original language	English
Pages (from-to)	119-123
Number of pages	5
Journal	Discrete Mathematics
Volume	234
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(00)00395-2
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

Access to Document

10.1016/S0012-365X(00)00395-2

Cite this

@article{5c0041e9f4c14da08b6ebea62debc04e,

title = "The number of edges in critical strongly connected graphs",

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",

author = "Ron Aharoni and Eli Berger",

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.",

year = "2001",

month = may,

day = "6",

doi = "10.1016/S0012-365X(00)00395-2",

language = "English",

volume = "234",

pages = "119--123",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - The number of edges in critical strongly connected graphs

AU - Aharoni, Ron

AU - Berger, Eli

N1 - 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.

PY - 2001/5/6

Y1 - 2001/5/6

N2 - We prove that the maximal number of directed edges in a vertex-critical strongly connected simple digraph on n vertices is (n2) - n + 4.

AB - We prove that the maximal number of directed edges in a vertex-critical strongly connected simple digraph on n vertices is (n2) - n + 4.

KW - Strongly connected digraphs

KW - Vertex-critical

UR - https://www.scopus.com/pages/publications/0035815858

U2 - 10.1016/S0012-365X(00)00395-2

DO - 10.1016/S0012-365X(00)00395-2

M3 - Article

AN - SCOPUS:0035815858

SN - 0012-365X

VL - 234

SP - 119

EP - 123

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

The number of edges in critical strongly connected graphs

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this