Marine yeasts — a review

Yeasts are ubiquitous in their distribution and populations mainly depend on the type and concentration of organic materials. The distribution of species, as well as their numbers and metabolic characteristics were found to be governed by existing environmental conditions. Marine yeasts were first discovered from the Atlantic Ocean and following this discovery, yeasts were isolated from different sources, viz. seawater, marine deposits, seaweeds, fish, marine mammals and sea birds. Nearshore environments are usually inhabited by tens to thousands of cells per litre of water, whereas low organic surface to deep-sea oceanic regions contain 10 or fewer cells/litre. Aerobic forms are found more in clean waters and fermentative forms in polluted waters. Yeasts are more abundant in silty muds than in sandy sediments. The isolation frequency of yeasts fell as the depth of the sampling site is increased. Major genera isolated in this study were Candida, Cryptococcus, Debaryomyces and Rhodotorula. For biomass estimation ergosterol method was used. Classification and identification of yeasts were performed using different criteria, i.e. morphology, sexual reproduction and physiological/biochemical characteristics. Fatty acid profiling or molecular sequencing of the IGS and ITS regions and 28S gene rDNA ensured accurate identification.

Equal opportunity networks, distance-balanced graphs, and Wiener game

Given a graph G and a set X ⊆ V(G), the relative Wiener index of X in G is defined as WX (G) = {u,v}∈X 2  dG(u, v) . The graphs G (of even order) in which for every partition V(G) = V1 +V2 of the vertex set V(G) such that |V1| = |V2| we haveWV1 (G) = WV2 (G) are called equal opportunity graphs. In this note we prove that a graph G of even order is an equal opportunity graph if and only if it is a distance-balanced graph. The latter graphs are known by several characteristic properties, for instance, they are precisely the graphs G in which all vertices u ∈ V(G) have the same total distance DG(u) = v∈V(G) dG(u, v). Some related problems are posed along the way, and the so-called Wiener game is introduced.