The path minimises the average size of a connected induced subgraph (Q2113349)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7488426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The path minimises the average size of a connected induced subgraph |
scientific article; zbMATH DE number 7488426 |
Statements
The path minimises the average size of a connected induced subgraph (English)
0 references
14 March 2022
0 references
connected graph
0 references
extremal graph theory
0 references
connected induced subgraph
0 references
average graph parameter
0 references
0 references
0.9115762710571288
0 references
0.8809076547622681
0 references
0.8164680600166321
0 references
0.7797961831092834
0 references
0.7407969832420349
0 references
