The length of a cycle basis of a graph G is the sum of the lengths of its cycles. Let C, c+ be the lengths of the minimal and maximal cycle basis, respectively. Then G has the cycle basis interpolation property (chip) if for all integers c, c-CC CC+, there exists a cycle basis of length c. We const
โฆ LIBER โฆ
A Family of special outerplanar graphs with only one triangle satisfying the cycle basis interpolation property
โ Scribed by Liu Yan
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 268 KB
- Volume
- 143
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
The length of a cycle basis of a graph G is the sum of the lengths of its cycles. Let c-, c+ be the lengths of the minima1 and maxima1 cycle basis, respectively. Then G has the cycle basis interpolation property (chip) if for all integers c, c-< c < c+, there exists a cycle basis of length c. In this paper, we will prove that a family of special outerplanar graphs with only one triangle, namely bamboo shoot graphs, have the chip.
๐ SIMILAR VOLUMES
Two families of graphs satisfying the cy
โ
Elzbieta B. Jarrett
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 353 KB