Maximising the number of connected induced subgraphs of unicyclic graphs (Q5879474)
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: Maximising the number of connected induced subgraphs of unicyclic graphs |
scientific article; zbMATH DE number 7658180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximising the number of connected induced subgraphs of unicyclic graphs |
scientific article; zbMATH DE number 7658180 |
Statements
Maximising the number of connected induced subgraphs of unicyclic graphs (English)
0 references
1 March 2023
0 references
induced subgraphs
0 references
connected graphs
0 references
unicyclic graphs
0 references
girth
0 references
pendant vertices
0 references
0.8205952644348145
0 references
0.8111675381660461
0 references
0.8080835342407227
0 references
0.7921174764633179
0 references
