On networks with maximum graphical structure and tenacity \(T\) (Q2768128)
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: On networks with maximum graphical structure and tenacity \(T\) |
scientific article; zbMATH DE number 1699114
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On networks with maximum graphical structure and tenacity \(T\) |
scientific article; zbMATH DE number 1699114 |
Statements
15 April 2002
0 references
tenacity
0 references
number of edges
0 references
0.9211576
0 references
0.91436994
0 references
0.88487506
0 references
On networks with maximum graphical structure and tenacity \(T\) (English)
0 references
The tenacity of a graph \(G\), \(T(G),\) is given by \(T(G)=\min \{\frac{|A|+\tau (G- A)}{\omega (G)}\}\), where the minimum is taken over all vertex cuts \(A\) of \(G,\) \(\tau (H)\) is the order of the largest component of \(H,\) and \(\omega (H)\) is the number of components of \(H.\) The maximum number of edges of a graph with given order and tenacity is determined.
0 references
