The number of cutvertices in graphs with given minimum degree (Q912123): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q127646311, #quickstatements; #temporary_batch_1723714016773 |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Lane H. Clark / rank | |||
Property / author | |||
Property / author: Roger Entringer / rank | |||
Property / reviewed by | |||
Property / reviewed by: B. Andrasfai / rank | |||
Property / author | |||
Property / author: Lane H. Clark / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Roger Entringer / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: B. Andrasfai / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of cutvertices in graphs with given minimum degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4083716 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An extremal problem in graph theory / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127646311 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:27, 15 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The number of cutvertices in graphs with given minimum degree |
scientific article |
Statements
The number of cutvertices in graphs with given minimum degree (English)
0 references
1990
0 references
Let h(n,d) denote the maximum number of cutvertices in a connected graph of order n having minimum degree at least d. The authors show that for \(n-1d>\geq 5\), \[ h(n,d)=2\lfloor \frac{n}{d+1}\rfloor +2\lfloor \frac{n}{(d+1)(d^ 2-2)}\rfloor +e(n), \] where e(n) is well-defined and \(\epsilon\) \(\{\)-3,-2,-1,0\(\}\).
0 references
maximum number of cutvertices
0 references
minimum degree
0 references