A note on fundamental, non-fundamental, and robust cycle bases

In many biological systems, robustness is achieved by redundant wiring, and reflected by the presence of cycles in the graphs connecting the systems' components. When analyzing such graphs, cyclically robust cycle bases of are of interest since they can be used to generate all cycles of a given 2-connected graph by iteratively adding basis cycles. It is known that strictly fundamental (or Kirchhoff) bases, i.e., those that can be derived from a spanning tree, are not necessarily cyclically robust. Here we note that, conversely, cyclically robust bases (even of planar graphs) are not necessarily fundamental. Furthermore, we present a class of cubic graphs for which cyclically robust bases can be explicitly constructed.