An edge extremal result for subcohesion (Q790835): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The cohesiveness of a point of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3852212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5572939 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: <i>k</i>-Components, Clusters and Slicings in Graphs / rank | |||
Normal rank | |||
Latest revision as of 12:15, 14 June 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
