In a recent paper [l] K . CORRÁDI and A. HAJNAL proved that if a finite graph without multiple edges contains at least 3k vertices and the valency of every vertex is at least 2k, where k is a positive integer, then the graph contains k independent circuits, i . e . the graph contains as a subgraph a set of k circuits no two of which have a vertex in common . The present paper contains extension...

Abstract The criteria for the definition of a new mineral species currently used by Commission on New Minerals Nomenclature and Classification (CNMNC) International Mineralogical Association are critically examined. In particular, rule dominant constituent can violate laws conservation electric charge. A series additional rules: (1) valency-imposed double site-occupancy; (2) dominant-valency ru...

This article discusses the valency-increasing mechanism in Dawan language. The data was obtained through observation of language speakers by applying note-taking method. Other were from literature Dawan's language, namely Beno Alekot (bible) and Si Knino (songbook). In addition, is supported intuitive researcher as a native speaker Considering variety dialects this discussion are focused on Ama...

This contribution presents a dependency grammar (DG) account of control and raising in English. Due to the minimalism of DG analyses of sentence structure, the difference between control and raising cannot be captured in the syntactic structure alone. The situation forces the DG account to reach to some other aspect of dependency syntax other than the raw hierarchies of structure to account for...

1. Ions with the opposite sign of charge as that of a protein ion diminish the swelling, osmotic pressure, and viscosity of the protein. Ions with the same sign of charge as the protein ion (with the exception of H and OH ions) seem to have no effect on these properties as long as the concentrations of electrolytes used are not too high. 2. The relative depressing effect of different ions on th...

Free word order languages have relatively unrestricted local word group or phrase structures that make the problem of chunking quite challenging. On the other hand, a robust chunker can drastically reduce the complexity of a parser that follows. We present here a computational framework for chunking of free word order languages based on a generalization of the valency theory. Every word has cer...