the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

Multicompartmental trigeminal schwannomas (MTSs) are a rare and complex but treatable group of tumors. Herein, we describe the clinicoradiologic presentation of two patients with MTS. The two illustrated distinct case reports highlight the role of imaging and the outcome of two different types of MTS. The Discussion summarizes the literature to date, which will help the reader diagnose these tu...

The first icosacationic bis(fullerene) whose water solubility is provided by twenty peripheral ammonium groups has a rigid, almost cylindrical shape and was synthesized by connecting two fullerene cores with a chiral cyclo-bis(malonate), followed by the regioselective addition of ten amino-terminated malonates into the octahedral positions of the fullerene moieties and subsequent cleavage of th...