A characterization of graphs where the independence number equals the radius (Q1926039)
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 6118552
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of graphs where the independence number equals the radius |
scientific article; zbMATH DE number 6118552 |
Statements
A characterization of graphs where the independence number equals the radius (English)
0 references
27 December 2012
0 references
ciliate
0 references
bipartite number
0 references
forest number
0 references
independence number
0 references
path number
0 references
radius
0 references
scaffold
0 references
tree number
0 references
0.7970505952835083
0 references
0.7594953179359436
0 references
0.7552007436752319
0 references
0.7437180876731873
0 references
