Slovenija Abstract A vertex-transitive graph is said to be 1 2-transitive if its automor-phism group is vertex and edge but not arc-transitive. Some recent results on 1 2-transitive graphs are given, a few open problems proposed , and possible directions in the research of the structure of these graphs discussed. 1 In the beginning Throughout this paper graphs are simple and, unless otherwise s...

A subgroup of the automorphism group a graph acts half-arc-transitively on if it transitively vertex-set and edge-set but not arc-set graph. If full half-arc-transitively, is said to be half-arc-transitive. In 1994 Gardiner Praeger introduced two families tetravalent arc-transitive graphs, called C±1 C±ε that play prominent role in characterization graphs admitting an automorphisms with normal ...

LinkedDictAbs = Cat ** { fun consecutive_01624944_A : A ; fun consequently_00061939_Adv : Adv ; fun conservation_06171333_N : N ; fun conspire_00562077_V : V ; fun sing_01362553_V2 : V2 ; ........ } The first line in the above given code states that the module ‘LinkedDictAbs’ is an abstract representation (note the keyword ‘abstract’). This module extends (achieved by ‘**’ operator) another mod...

Classical pitch-based perturbation measures, such as Jitter and Shimmer, are generally based on detection algorithms of pitch marks which assume the existence of a periodic pitch pattern and/or rely on the linear source-filter speech model. While these assumptions can hold for normal speech, they are generally not valid for pathological speech. The latter can indeed present strong aperiodicity,...

In this special issue on "Fuzzy Expert Systems," six papers cover a wide range of concerns--from theory to applications including: (1) a rule base reorganization, (2) a linear interpolation, (3) a neuro-fuzzy approach to pairwise comparison, (4) properties of reduction, in transitive matrices, (5) a consistency checking procedure, and (6) a context dependency model. We present a brief review of...

This paper is a contribution towards the determination of all finite distance-transitive graphs. We obtain a classification of all the antipodal distance-transitive graphs having as antipodal quotient a complete graph Kn . Such a graph necessarily has diameter 2 or 3 (see for example [2, Proposition 4.2.2 (ii)]). Those of diameter 2 are simply the complete multipartite graphs Kr,...,r with n pa...