Edge vulnerability parameters of split graphs (Q2371083)
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 5168929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge vulnerability parameters of split graphs |
scientific article; zbMATH DE number 5168929 |
Statements
Edge vulnerability parameters of split graphs (English)
0 references
29 June 2007
0 references
The authors prove that for a noncomplete connected split graph, its edge-connectivity equals its minimum degree. A formula is derived for computing the edge-toughness of noncomplete connected split graphs. Lastly, the authors show that the edge-integrity of a noncomplete connected split graph equals its order when its minimum degree is greater than half of the size of its largest clique.
0 references
split graph
0 references
edge-connectivity
0 references
edge-toughness
0 references
edge-integrity
0 references
0.9618289
0 references
0.9610855
0 references
0 references
0.88644505
0 references
0.8695725
0 references
0.8687595
0 references
0.8653364
0 references
0.8634507
0 references
0 references
