نتایج جستجو برای: edge density
تعداد نتایج: 515490 فیلتر نتایج به سال:
Efforts have been made to elucidate the origin of d(0) magnetism in ZnO nanocactuses (NCs) and nanowires (NWs) using X-ray-based microscopic and spectroscopic techniques. The photoluminescence and O K-edge and Zn L3,2-edge X-ray-excited optical luminescence spectra showed that ZnO NCs contain more defects than NWs do and that in ZnO NCs, more defects are present at the O sites than at the Zn si...
In 1941, Turán conjectured that the edge density of any 3-graph without independent sets on 4 vertices (Turán (3, 4)-graph) is≥ 4/9(1− o(1)), and he gave the first example witnessing this bound. Brown (1983) and Kostochka (1982) found many other examples of this density. Fon-der-Flaass (1988) presented a general construction that converts an arbitrary ~ C4-free orgraph Γ into a Turán (3, 4)-gra...
Mechanisms determining the structure of edge temperature and density pedestals, which are associated with edge transport barrier (ETB) formation in tokamaks, are investigated on Alcator C-Mod. Experiments suggest a strong role for critical gradient behavior in setting profile characteristics of edge plasma. The maximum pressure gradient scales as the square of plasma current in both H-modes wit...
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
Excessive edge density in graphs can cause serious readability issues, which in turn can make the graphs difficult to understand or even misleading. Recently, we introduced the idea of providing tools that offer interactive edge bending as a method by which edge congestion can be disambiguated. We extend this direction, presenting a new tool, Edge Plucking, which offers new interactive methods ...
We study a mean field model of a complex network, focusing on edge and triangle densities. Our first result is the derivation of a variational characterization of the entropy density, compatible with the infinite node limit. We then determine the optimizing graphs for small triangle density and a range of edge density, though we can only prove they are local, not global, maxima of the entropy d...
let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is the number of edge coverings of $g$ of size $i$, and$rho(g)$ is the edge covering number of $g$. in this paper we stud...
let g=(v,e) be a simple graph. an edge labeling f:e to {0,1} induces a vertex labeling f^+:v to z_2 defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where z_2={0,1} is the additive group of order 2. for $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. a labeling f is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. i_f(g)=v_f(1)-v_f(0) is called the edge-f...
We consider a class of interaction terms that describes correlated tunneling of composite fermions between effective Landau levels. Despite being generic and of similar strength to that of the usual density-density couplings, these terms are not included in the accepted theory of the edges of fractional quantum Hall systems. Here we show that they may lead to an instability of the edge towards ...
The multi-edge type LDPC codes, introduced by Richardson and Urbanke, present the general class of structured LDPC codes. In this paper, we derive the average weight distributions of the multi-edge type LDPC code ensembles. Furthermore, we investigate the asymptotic exponential growth rate of the average weight distributions and investigate the connection to the stability condition of the densi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید