Graphs with most number of three point induced connected subgraphs (Q1804874)
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 756140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with most number of three point induced connected subgraphs |
scientific article; zbMATH DE number 756140 |
Statements
Graphs with most number of three point induced connected subgraphs (English)
0 references
17 May 1995
0 references
It is known that graphs which maximize the residual connectedness reliability (in the node failure model) among all graphs with given numbers of vertices and edges are related to graphs which maximize the number of induced, 3-vertex connected subgraphs. This paper characterizes the latter graphs with not too many edges.
0 references
reliability
0 references
connected subgraphs
0 references
0.7623745799064636
0 references
