نتایج جستجو برای: regular vs preparatory classes
تعداد نتایج: 507289 فیلتر نتایج به سال:
The total chromatic number, χ″(G) is the minimum number of colors which need to be assigned obtain a coloring graph G. Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, χ″(G)≤Δ(G)+2, where Δ(G) represents maximum degree In this paper we obtained some classes four regular circulant graphs.
abstract this study aimed at analyzing a corpus of emails gathered from iranian students studying in england. the corpus contained 996 emails that were investigated by employing the framework of chen (2006) to find common patterns in the discourse of these emails. another aim of the study was to find how two request acts (want statements and query preparatory) were used in the emails. the...
Infinite games are studied in a format where two players, called Player 1 and Player 2, generate a play by building up an ω-word as they choose letters in turn. A game is specified by the ω-language which contains the plays won by Player 2. We analyze ω-languages generated from certain classes K of regular languages of finite words (called ∗-languages), using natural transformations of ∗-langua...
Background & Aim: Post cesarean ileus is a common complication that induces abdominal distention, delays feeding, and increases hospitalization. Multiple studies showed that false nutrition increases the bowel movement. This study aimed to investigate the effect of gum chewing as false nutrition on the bowel movement and prevention of post cesarean ileus. Methods & Materials: In this randomize...
emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.
In this paper we investigate the Green graphs for the regular and inverse semigroups by considering the Green classes of them. And by using the properties of these semigroups, we prove that all of the five Green graphs for the inverse semigroups are isomorphic complete graphs, while this doesn't hold for the regular semigroups. In other words, we prove that in a regular se...
1.1. Matching regular semisimple conjugacy classes. Let X(F ) = F × F×, viewed as the space of semisimple conjugacy classes in GL2(F ) via GL2(F ) → X(F ) sending γ 7→ (Tr(γ),det(γ)). Similarly we have D× → X(F ) sending γ′ 7→ (TrD/F (γ),NmD/F (γ′)), where TrD/F and NmD/F mean reduced trace and norm. For regular semisimple γ ∈ GL2(F ) and γ′ ∈ D×, we write γ ∼ γ′ if they have the same image in ...
This study examines the storage vs. composition of Spanish inflected verbal forms in L1 and L2 speakers of Spanish. L2 participants were selected to have mid-to-advanced proficiency, high classroom experience, and low immersion experience, typical of medium-to-advanced foreign language learners. Participants were shown the infinitival forms of verbs from either Class I (the default class, which...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید