The well known types of routes in graphs and directed graphs, such as walks, trails, paths, and induced paths, are characterized using axioms on vertex sequences. Thus non-graphic characterizations of the various types of routes are obtained.

Children who require augmentative and alternative communication (AAC) systems while they are in the process of acquiring language face unique challenges because they use graphic symbols for communication. In contrast to the situation of typically developing children, they use different modalities for comprehension (auditory) and expression (visual). This study explored the ability of three- and...

Words written with the initial graphic sequences “es+C” and “ex+C” raise many problematic questions to the phonology of European Portuguese since the production of these sequences is changing (Delgado Martins et al, 1996:302). This paper focuses on the analysis of how the speakers produce and segment these –sC clusters and on the variables that might affect these tasks. Therefore, we conducted ...

Identifying protein-coding regions in DNA sequences is an active issue in computational biology. In this study, we present a self adaptive spectral rotation (SASR) approach, which visualizes coding regions in DNA sequences, based on investigation of the Triplet Periodicity property, without any preceding training process. It is proposed to help with the rough coding regions prediction when ther...

Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on realizations graphic degree sequences simple graphs. Several results were proved rapidly unconstrained, bipartite, and directed sequences, using different mechanisms. The aim this paper is unify these approaches. We will illustrate strength unified method by showing that any P-stable family uncon...