Trivially extendable graphs (Q2832241)
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 6651430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Trivially extendable graphs |
scientific article; zbMATH DE number 6651430 |
Statements
10 November 2016
0 references
independence number
0 references
extendable graphs
0 references
trivially extendable graphs
0 references
Trivially extendable graphs (English)
0 references
A graph is \(k\)-extendable if every independent set of order \(k\) is contained in a maximum independent set. It is called trivially extendable if it is \(k\)-extendable only for \(k\) being equal the independence number. In this paper, trivially extendable graphs are described among the graphs \(G\) having the independence number equal \(|V(G)|-2\) and \(|V(G)|-3\), respectively.
0 references
0.837378978729248
0 references
0.8030849099159241
0 references
