On deletions of largest bonds in graphs

A well-known conjecture of Scott Smith is that any two distinct longest cycles of a k-connected graph must meet in at least k   vertices when k≥2k≥2. We provide a dual version of this conjecture for two distinct largest bonds in a graph. This dual conjecture is established for k⩽6k⩽6.