in this paper we define the removable cycle that, if $im$ is a class of graphs, $gin im$, the cycle $c$ in $g$ is called removable if $g-e(c)in im$. the removable cycles in eulerian graphs have been studied. we characterize eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles h...

BACKGROUND The biomechanical property of MGT for patients who underwent partial sacrectomy is not well documented, so this study aimed to investigate biomechanical property of lumbosacral reconstruction after partial sacrectomy. MATERIAL AND METHODS Three 3-dimensional finite element models of lumbosacral region were established: 1) an intact model (INT), 2) a defective model in which partial...

The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...

In this paper we consider long-memory processes obtained by aggregation of independent random parameter AR(1) processes. We propose an estimator of the density of the underlying random parameter. This estimator is based on the expansion of the density on the Gegenbauer basis. A rate of convergence to zero of the mean integrated square error (MISE) and of the uniform error is obtained. The resul...

The optimal value of the smoothing parameter of the Kernel estimator can be obtained by the well known Plug-in algorithm. The optimality is realised in the sense of Mean Integrated Square Error (MISE). In this paper, we propose to generalise this algorithm to the case of the difficult problem of the estimation of a distribution which has a bounded support. The proposed algorithm consists in sea...

the eccentricity connectivity index of a molecular graph g is defined as (g) = av(g)deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to othervertices of g and deg(a) is degree of vertex a. here, we compute this topological index forsome infinite classes of dendrimer graphs.

Abstract. A graphical expansion formula for non-commutative matrix integrals with values in a finite-dimensional real or complex von Neumann algebra is obtained in terms of ribbon graphs and their non-orientable counterpart called Möbius graphs. The contribution of each graph is an invariant of the topological type of the surface on which the graph is drawn. As an example, we calculate the inte...

RÉSUMÉ. L’évolution des techniques de diagnostic et de traitement clinique amène à une exposition croissante des patients à des radiations ionisantes qui constituent elles-mêmes un risque pour la santé. La problématique du suivi des doses cumulées se pose donc et nécessite la mise en place de mécanismes d’échange d’information. Plusieurs protocoles (notamment IHE-REM, HL7, KMEHR) se développent...

Résumé La chorée du Sydenham est la première cause de chorée acquise dans le tiers monde. Nous rapportons le cas d'une Chorée récurrente traitée avec succès par le valproate du sodium. Mlle A.C âgée de 16 ans ayant comme antécédents des angines à répétition et un épisode de mouvement choréique il y a 2 ans, pour lequel elle a été mise sous Halopéridol et sous prévention du rhumatisme articulair...