Cut and pendant vertices and the number of connected induced subgraphs of a graph (Q2040982)
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: Cut and pendant vertices and the number of connected induced subgraphs of a graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cut and pendant vertices and the number of connected induced subgraphs of a graph |
scientific article |
Statements
Cut and pendant vertices and the number of connected induced subgraphs of a graph (English)
0 references
15 July 2021
0 references
cut vertex
0 references
pendant vertex
0 references
induced subgraph
0 references
connected graph
0 references
extremal graph structure
0 references
tree
0 references
0.7921174764633179
0 references
0.7796423435211182
0 references
0.7760165929794312
0 references
0.7538704872131348
0 references
