An edge extremal result for subcohesion (Q790835)
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: An edge extremal result for subcohesion |
scientific article; zbMATH DE number 3849269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An edge extremal result for subcohesion |
scientific article; zbMATH DE number 3849269 |
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
0.7910022735595703
0 references
0.7644665837287903
0 references
0.759843647480011
0 references
0.7544161677360535
0 references
0.7505061030387878
0 references
