Arm swimming in the octopus is a mode of locomotion that is used by the animal primarily for hunting, defence, or escape. The motion, in general, is characterized by a fast closing of the arms and a slow opening of the arms, resulting in a considerable propulsive power. The movement has previously been discussed, however the detailed kinematics is still unknown. For that, we investigated in det...

The European Union (EU) is one of the most important markets for cephalopods in world. Currently, small-scale fisheries targeting common octopus EU are considerable social and economic importance, especially southern waters where more consumed as part traditional diet. Octopuses Europe excluded from quota regulations under Common Fisheries Policy Member States manage their employing different i...

Daily periodicity of growth increments in stylets was validated in wild-caught Octopus vulgaris maintained under controlled conditions. It was corroborated by staining the stylets either with oxytetracycline or tetracycline, and comparing the number of rings produced with the number of days elapsed. In all, 19 animals (10 males and 9 females; 680–1470 g body weight) were injected with oxytetrac...

During the present study, we aimed at providing a first look at the elemental composition of the early stages of cephalopods as an approach to their elemental requirements in culture. Essential and non-essential elemental profiles of the European cuttlefish Sepia officinalis, the European squid Loligo vulgaris and the common octopus Octopus vulgaris laboratory hatchlings and wild juveniles were...

This work reports a genetic data of Octopus vulgaris, marine species of high commercial value, from nineteen localities of Atlantic, Mediterranean and the Adriatic regions. We used mitochondrial DNA cytochrome c oxidase subunit I (COI) gene to investigate the genetic structure of common octopus. Our results indicated a significant genetic structuring in the study area (Phi = 0.136, P <0.001) an...

A d-octopus of a graph G = (V; E) is a subgraph T = (W; F) of G such that W is a dominating set of G, and T is the union of d (not necessarily disjoint) shortest paths of G that have one endpoint in common. First, we study the complexity of 5nding and approximating a d-octopus of a graph. Then we show that for some NP-complete graph problems that are hard to approximate in general there are e9c...