A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph

We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors.     

TOF-SIMS imaging of chlorhexidine-digluconate transport in frozen hydrated biofilms of the fungus Candida albicans

The diffusion of the anti-microbial chlorhexidine digluconate (CHG) has been studied in C. albicans biofilms by time-of-flight secondary-ion mass spectrometry (TOF-SIMS). C. albicans has been shown to become resistant to common anti-microbial agents, including CHG, when growing as a biofilm. Mass transport resistance within biofilms has commonly been suggested as a resistance mechanism, but measurement of transport for most anti-microbial agents in biofilms has proven extremely difficult because of the heterogeneity of the biofilms and the difficulty in detecting these agents within an intact biofilm. In this study, TOF-SIMS has been used to study the transport of CHG and glucose in a frozen hydrated biofilm. The TOF-SIMS images reveal a progression of CHG from the top of the biofilm to its base with time. Images suggest that there are channels within the biofilm and show preferential binding of CHG to cellular components of the biofilm. Additionally, both living and dead cells can be identified in the TOF-SIMS images by the sequestration of K⁺ and the presence of cell markers. This study demonstrates that TOF-SIMS has the unique potential to simultaneously observe the presence of an antimicrobial agent, concentration of nutrients, and the viability of the cell population.     

Cyclic permutations and evolutionary trees

Given a tree with leaf set X, there are certain ways of arranging the elements of X in a circular order so that can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X.     

中国邮路问题的一个解法

本给出中国邮路问题的一个解法。虽然它仍只是初始方案，但因考虑了问题的足够信息，因而这种方案至少拉近了与最优解的距离。     

一种基于图论与熵的专家判断客观可信度的确定方法

本文给出一种群决策中确定专家判断可信度的方法，其主要思路是首先通过图论中最小生成树的方法提取专家判断矩阵的全部信息，其次，使用相对熵指标确定获得专家判断的最终结果，并同时衡量专家自身判断的统一程度，从而确定专家判断的相对客观可信度。最后，文章给出一个典型的算例以说明该方法的可行性和有效性。     

Dynamic surface tension measurements of surfactant solutions using the maximum bubble pressure method – limits of applicability

One of the essential differences in the design of bubble pressure tensiometers consists in the geometry of the measuring capillaries. To reach extremely short adsorption times of milliseconds and below, the so-called deadtime of the capillaries must be of the order of some 10 ms. In particular, for concentrated surfactant solutions, such as micellar solutions, short deadtimes are needed to minimize the initial surfactant load of the generated bubbles. A theoretical model is derived and confirmed by experiments performed for a wide range of experimental conditions, mainly in respect to variations in deadtime and bubble volume.     

Searching in trees

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.