Abstract
A construction for a minimum cycle basis for the Cartesian and the strong product of two graphs from the minimum length cycle bases of the factors is presented. Furthermore, we derive asymptotic expressions for the average length of the cycles in the minimum cycle bases of the powers (iterated products) of graphs. In the limit only triangles and squares play a role.
| Original language | English |
|---|---|
| Pages (from-to) | 233-244 |
| Number of pages | 12 |
| Journal | Australasian journal of combinatorics |
| Volume | 26.2002 |
| Publication status | Published - 2002 |