Natural Computing is concerned with human-designed computing inspired by nature as well as with computation taking place in nature. The latter strand of research investigates in terms of informationâ€¦ (More)

We study the interplay between principal pivot transform (pivot) and loop complementation for graphs. This is done by generalizing loop complementation (in addition to pivot) to set systems. We showâ€¦ (More)

We provide a unified framework in which the interlace polynomial and several related graph polynomials are defined more generally formultimatroids and delta-matroids. Using combinatorial propertiesâ€¦ (More)

We give a characterization of the effect of sequences of pivot operations on a graph by relating it to determinants of adjacency matrices. This allows us to deduce that two sequences of pivotâ€¦ (More)

Several properties of the isotropic matroid of a looped simple graph are presented. Results include a characterization of the multimatroids that are associated with isotropic matroids and severalâ€¦ (More)

We study the set of output stable configurations of chemical reaction deciders (CRDs). It turns out that CRDs with only bimolecular reactions (which are almost equivalent to population protocols)â€¦ (More)

If G is a looped graph, then its adjacency matrix represents a binary matroid MA(G) on V (G). MA(G) may be obtained from the delta-matroid represented by the adjacency matrix of G, but MA(G) is lessâ€¦ (More)