Two families of graphs satisfying the cycle basis interpolation property (Q757419)
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: Publication:757419 |
scientific article; zbMATH DE number 4191705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two families of graphs satisfying the cycle basis interpolation property |
scientific article; zbMATH DE number 4191705 |
Statements
Two families of graphs satisfying the cycle basis interpolation property (English)
0 references
1990
0 references
Let \(c^-\) and \(c^+\) be the sum of the lengths of the cycles comprising a minimal and a maximal cycle basis of a graph G, respectively. G has the cycle basis interpolation property (cbip) if for any integer c, \(c^-\leq c\leq c^+\), G has a cycle basis of length c. The author constructs two families of graphs, snake-graphs and kite- graphs, that have the cbip, giving explicitly a maximal cycle basis for each type.
0 references
cycle basis interpolation property
0 references
snake-graphs
0 references
kite-graphs
0 references
0.889539897441864
0 references
0.8843172192573547
0 references
0.8752776980400085
0 references
0.8741986751556396
0 references
0.8635895848274231
0 references