Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs (Q2268243)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs |
scientific article; zbMATH DE number 5679562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs |
scientific article; zbMATH DE number 5679562 |
Statements
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs (English)
0 references
10 March 2010
0 references
graph theory
0 references
identifying code
0 references
twins
0 references
twin-free graph
0 references
identifiable graph
0 references
minimum degree
0 references
maximum independent set
0 references
maximum stable set
0 references
radius
0 references
diameter
0 references
0.9289456605911256
0 references
0.8999276757240295
0 references
0.8248734474182129
0 references
0.7741249799728394
0 references
0.7500097751617432
0 references
