Random d-regular graphs have been well studied when d is fixed and the number of vertices goes to infinity. We obtain results on many of the properties of a random d-regular graph when d = d n grows more quickly than √n. These properties include connectivity, hamiltonicity, independent set size, chromatic number, choice number, and the size of the second eigenvalue, among others. © 2001 John Wi...

The isomorphism classes of several types of graph coverings of a graph have been enumerated by many authors [M. Hofmeister, Graph covering projections arising from finite vector space over finite fields, Discrete Math. 143 (1995) 87–97; S. Hong, J.H. Kwak, J. Lee, Regular graph coverings whose covering transformation groups have the isomorphism extention property, Discrete Math. 148 (1996) 85–1...

We consider several types of similarity relationships between languages, and for an arbitrary language class we define appropriate similarity classes. We show that for any of the classes of regular, linear, contextfree, context-sensitive, recursive and recursively enumerable languages the appropriate similarity classes form an uncountable hierarchy of order type ω + λ + 2. We also show that the...

This publication addresses the generation of a musical score of percussive un-pitched instruments. A musical event is defined as the occurrence of a sound of a musical instrument. The presented method is restricted to events of percussive instruments without determinate pitch. Events are detected in the audio signal and classified into instrument classes, the temporal positions of the events ar...

The aim of this study was to determine how an additional load influences the force-vs-time relationship of the countermovement vertical jump (CMVJ). The participants that took part in the experiment were 18 male university students who played sport recreationally, including regular games of volleyball. They were asked to perform a CMVJ without involving the arms under four conditions: without a...

In this paper we use a duality result between equations and coequations for automata, proved by Ballester-Bolinches, Cosme-Llópez, and Rutten to characterize nonempty classes of deterministic automata that are closed under products, subautomata, homomorphic images, and sums. One characterization is as classes of automata defined by regular equations and the second one is as classes of automata ...

Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence related more general classes of regular languages with classes of more complex algebraic objects. Such generalized varieties also have natural counterparts formed by classes of finite automata equipped wi...

The class of matroids representable over all fields is the class of regular matroids. The class of matroids representable over all fields except perhaps GF (2) is the class of near-regular matroids. Let k be a non-negative integer. This thesis considers the class of k–regular matroids, a generalization of the last two classes. Indeed, the classes of regular and near-regular matroids coincide wi...

The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the decycling numbers of random regular graphs. For a random cubic graph G of order n, we prove that (G) n/4 1/ 2 holds asymptotically almost surely. This is the result of executing a greedy algorithm for decycling G makin...

The near-critical behavior of (d = 3)-dimensional Ising-model ferromagnets or simple lattice gases with equivalent first, second, and third nearest-neighbor interactions is studied through Monte Carlo simulations using histogram reweighting techniques and comparisons with series expansions. By carefully analyzing numerical data from relatively small finite systems using scaling and extrapolatio...