An edge extremal result for subcohesion (Q790835): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(85)90087-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992747407 / rank | |||
Normal rank | |||
Revision as of 02:34, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An edge extremal result for subcohesion |
scientific article |
Statements
An edge extremal result for subcohesion (English)
0 references
1985
0 references
The edge-subconnectivity of a graph is defined to be the largest of all the subgraph edge connectivities. A graph is said to be type \((n,\ell)\) if no subgraph on \(\ell\) or more points is n-edge connected. A canonical class of \((n,\ell)\) graphs called star-like-\((n,\ell)\) graphs are introduced. It is then shown that no \((n,\ell)\) graph has more edges than these canonical graphs.
0 references
edge-connectivity
0 references
cohesion
0 references
edge-subconnectivity
0 references
