
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.
Extremal problems in graph theory, Connectivity, Edge-integrity, split graph, Applied Mathematics, edge-toughness, Edge-connectivity, edge-integrity, Split graph, Edge-toughness, edge-connectivity
Extremal problems in graph theory, Connectivity, Edge-integrity, split graph, Applied Mathematics, edge-toughness, Edge-connectivity, edge-integrity, Split graph, Edge-toughness, edge-connectivity
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
