‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

In cooperation with IVECO Magirus for the new generation of fire turntable ladders a trajectory tracking control was developed to avoid swaying of the cage especially in case of large ladder lengths. Beside the active damping of the upcoming oscillations as a new functionality a automated mode for the ladder operation was implemented. This automated mode has to provide time indexed reference fu...

Bethe-Salpeter (BS) equation in Minkowski space for scalar particles is solved for a kernel given by a sum of ladder and cross-ladder exchanges. The solution of corresponding Light-Front (LF) equation, where we add the time-ordered stretched boxes, is also obtained. Cross-ladder contributions are found to be very large and attractive, whereas the influence of stretched boxes is negligible. Both...

Physical nature of dimensional crossovers in coupled one-dimensional systems has currently provoked a great deal of controversy. Recent discovery of the superconductivity in the doped spin ladder under pressure has stimulated us to study the dimensional crossover problem in the weakly coupled ladder system. In the present work, based on the perturbative renormarization-group approach (PRG) deve...

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.

Fully conjugated ladder polymers (cLPs), in which all the backbone units on the polymer main-chain are π-conjugated and fused, have attracted great interest owing to their intriguing properties, remarkable chemical and thermal stability, and potential suitability as functional organic materials. The synthesis of cLPs can be, in general, achieved by two main strategies: single-step ladderization...

In this paper, we introduce a new model of the crystal B(Λ0) of c sl`. We briefly describe some of the properties of this crystal and compare it to the combinatorial model of Misra and Miwa. Résumé. Dans cet article on propose un nouveau modèle du cristal B(Λ0) de c sl`. On décrit brièvement les propriétés du cristal et on le compare avec le modèle combinatoire de Misra et Miwa.