On divisibility graph for simple Zassenhaus groups

The divisibility graph $D(G)$ for a finite group $G$ is a graph with vertex set $cs~(G)\setminus\{1\}$ where $cs~(G)$ is the set of conjugacy class sizes of $G$. Two vertices $a$ and $b$ are adjacent whenever $a$ divides $b$ or $b$ divides $a$. In this paper we will find $D(G)$ where $G$ is a simple Zassenhaus group

Divisibility graph for symmetric and alternating groups

Let $X$ be a non-empty set of positive integers and $X^*=X\setminus \{1\}$. The divisibility graph $D(X)$ has $X^*$ as the vertex set and there is an edge connecting $a$ and $b$ with $a, b\in X^*$ whenever $a$ divides $b$ or $b$ divides $a$. Let $X=cs~{G}$ be the set of conjugacy class sizes of a group $G$. In this case, we denote $D(cs~{G})$ by $D(G)$. In this paper we will find the number of connected components of $D(G)$ where $G$ is the symmetric group $S_n$ or is the alternating group $A_n$

The Divisibility Graph of finite groups of Lie Type

The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the Divisibility Graph of the finite groups of Lie type in odd characteristic

Quotient graphs for power graphs

In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of its quotient graphs. We apply here that procedure to the proper power graph $\mathcal{P}_0(G)$ of a finite group $G$, finding a formula for the number $c(\mathcal{P}_0(G))$ of its components which is particularly illuminative when $G\leq S_n$ is a fusion controlled permutation group. We make use of the proper quotient power graph $\widetilde{\mathcal{P}}_0(G)$, the proper order graph $\mathcal{O}_0(G)$ and the proper type graph $\mathcal{T}_0(G)$. We show that all those graphs are quotient of $\mathcal{P}_0(G)$ and demonstrate a strong link between them dealing with $G=S_n$. We find simultaneously $c(\mathcal{P}_0(S_n))$ as well as the number of components of $\widetilde{\mathcal{P}}_0(S_n)$, $\mathcal{O}_0(S_n)$ and $\mathcal{T}_0(S_n)$

Post stroke dementia and its putative risk factors: a hospital - based study

Introduction:Dementia is common after stroke and has a considerable impact on mortality, rehabilitation and quality of life. There are some published articles regarding post stroke dementia but there are many controversies surrounding this topic. Our aim was to identify the prevalence of post stroke dementia 3 months after stroke and evaluation of some its putative risk factors in Iranian population. Method: In this cross-sectional study, 151 patients with acute stroke were evaluated. The diagnosis was confirmed by physical examination and neuroimaging. Three months after the stroke, all patients were visited again. The diagnosis of post stroke dementia was made according to the criteria in the DSM-IV. Demographic data were collected using a questionnaire and data about lesion location and kind of stroke were obtained according to neuroimaging. To analyze the data, descriptive statistics, and chi-square test were used. Results: In our study, 47% patients were male and the rest were female. Thirty five (23.2%) of patients had post stroke dementia(PSD) after 3 months. 70.6 % of patients were 60 years old or more. 88.7% of patients had ischemic infarction and the rest had hemorrhagic stroke . The most frequent lesion locations were temporal, frontal and parietal lobes respectively., There was no significant statistical difference between PSD and sex, age, educational status, lesion location and kind of stroke. Conclusion: Our results show that a significant portion of patients with stroke are prone to PSD. The risk of dementia occurring after a stroke does not seem to be influenced by the stroke type

Application of the Aquifer Impact Model to support decisions at a CO2 sequestration site

The National Risk Assessment Partnership (NRAP) has developed a suite of tools to assess and manage risk at CO sequestration sites. The NRAP tool suite includes the Aquifer Impact Model (AIM), which evaluates the potential for groundwater impacts from leaks of CO and brine through abandoned wellbores. There are two aquifer reduced-order models (ROMs) included with the AIM tool, a confined alluvium aquifer, and an unconfined carbonate aquifer. The models accept aquifer parameters as a range of variable inputs so they may have broad applicability. The generic aquifer models may be used at the early stages of site selection, when site-specific data is not available. Guidelines have been developed for determining when the generic ROMs might be applicable to a new site. This paper considers the application of the AIM to predicting the impact of CO or brine leakage were it to occur at the Illinois Basin Decatur Project (IBDP). Results of the model sensitivity analysis can help guide characterization efforts; the hydraulic parameters and leakage source term magnitude are more sensitive than clay fraction or cation exchange capacity. Sand permeability was the only hydraulic parameter measured at the IBDP site. More information on the other hydraulic parameters could reduce uncertainty in risk estimates. Some non-adjustable parameters are significantly different for the ROM than for the observations at the IBDP site. The generic ROMs could be made more useful to a wider range of sites if the initial conditions and no-impact threshold values were adjustable parameters. © 2017 Society of Chemical Industry and John Wiley & Sons, Ltd. 2 2

Hamiltonicity of 3-arc graphs

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two arcs $uv, xy$ are adjacent if and only if $(v,u,x,y)$ is a 3-arc of $G$. In this paper we prove that any connected 3-arc graph is Hamiltonian, and all iterative 3-arc graphs of any connected graph of minimum degree at least three are Hamiltonian. As a consequence we obtain that if a vertex-transitive graph is isomorphic to the 3-arc graph of a connected arc-transitive graph of degree at least three, then it is Hamiltonian. This confirms the well known conjecture, that all vertex-transitive graphs with finitely many exceptions are Hamiltonian, for a large family of vertex-transitive graphs. We also prove that if a graph with at least four vertices is Hamilton-connected, then so are its iterative 3-arc graphs.Comment: in press Graphs and Combinatorics, 201