54 research outputs found
The structure of decomposition of a triconnected graph
We describe the structure of triconnected graph with the help of its
decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph
into rather small groups with a simple structure, named complexes. The detailed
description of all complexes is presented. Moreover, we prove that the
structure of a hypertree could be introduced on the set of all complexes. This
structure gives us a complete description of the relative disposition of the
complexes.
Keywords: connectivity, triconneted graphs.Comment: 49 pages, 8 figures. Russian version published in Zap. Nauchn. Sem.
POMI v.391 (2011), http://www.pdmi.ras.ru/znsl/2011/v391/abs090.htm
Beyond Blobs in Percolation Cluster Structure: The Distribution of 3-Blocks at the Percolation Threshold
The incipient infinite cluster appearing at the bond percolation threshold
can be decomposed into singly-connected ``links'' and multiply-connected
``blobs.'' Here we decompose blobs into objects known in graph theory as
3-blocks. A 3-block is a graph that cannot be separated into disconnected
subgraphs by cutting the graph at 2 or fewer vertices. Clusters, blobs, and
3-blocks are special cases of -blocks with , 2, and 3, respectively. We
study bond percolation clusters at the percolation threshold on 2-dimensional
square lattices and 3-dimensional cubic lattices and, using Monte-Carlo
simulations, determine the distribution of the sizes of the 3-blocks into which
the blobs are decomposed. We find that the 3-blocks have fractal dimension
in 2D and in 3D. These fractal dimensions are
significantly smaller than the fractal dimensions of the blobs, making possible
more efficient calculation of percolation properties. Additionally, the
closeness of the estimated values for in 2D and 3D is consistent with the
possibility that is dimension independent. Generalizing the concept of
the backbone, we introduce the concept of a ``-bone'', which is the set of
all points in a percolation system connected to disjoint terminal points
(or sets of disjoint terminal points) by disjoint paths. We argue that the
fractal dimension of a -bone is equal to the fractal dimension of
-blocks, allowing us to discuss the relation between the fractal dimension
of -blocks and recent work on path crossing probabilities.Comment: All but first 2 figs. are low resolution and are best viewed when
printe
Impact of Diabetes on Postinfarction Heart Failure and Left Ventricular Remodeling
Diabetes mellitus, the metabolic syndrome, and the underlying insulin resistance are increasingly associated with diastolic dysfunction and reduced stress tolerance. The poor prognosis associated with heart failure in patients with diabetes after myocardial infarction is likely attributable to many factors, important among which is the metabolic impact from insulin resistance and hyperglycemia on the regulation of microvascular perfusion and energy generation in the cardiac myocyte. This review summarizes epidemiologic, pathophysiologic, diagnostic, and therapeutic data related to diabetes and heart failure in acute myocardial infarction and discusses novel perceptions and strategies that hold promise for the future and deserve further investigation
- …