Counting unbranched subgraphs (Q1283455)
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 1275697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting unbranched subgraphs |
scientific article; zbMATH DE number 1275697 |
Statements
Counting unbranched subgraphs (English)
0 references
23 June 1999
0 references
For a given graph \(G=(V,E)\), its unbranched subgraph is defined to be an edge-induced spanning subgraph such that the degree of each vertex is not greater than 2. The main result shows that the real part of any root of the polynomial \[ Q(z)=\sum_{F}z^{| F| }, \] where \(F\) is taken over all the subsets of \(E\) such that \(F\) forms an unbranched subgraph of \(G\), is always negative.
0 references
unbranched subgraph
0 references
counting polynomial
0 references
0 references
0.7692936062812805
0 references
0.7656588554382324
0 references
0.7373700737953186
0 references
0.7204379439353943
0 references
