Results 251 to 260 of about 21,234 (294)

Surface-based image reconstruction optimization for high-density functional near-infrared spectroscopy. [PDF]

Neurophotonics
Carlton LB, Altınkaynak M, Kelley SM, Zimmermann BB, Kura S, Middell E, von Lühmann A, Stephen EP, Yücel MA, Boas DA.   +9 more
europepmc   +1 more source

Structural Exploration and Expected values of Topological Indices of Square-Hexagonal <i>T</i> _2,3 Kink Chains for Advanced Engineering Applications. [PDF]

ACS Omega
Kanwal S, Khalil M, Razzaque A.
europepmc   +1 more source

An Algorithm for Automatic Osteotomy Plate Placement Planning in 3D: Application in Distal Radius Malunion. [PDF]

Int J Comput Assist Radiol Surg
van de Nes E, Smees CJ, Olde Heuvel J, Vochteloo AJH, Tuijthof GJM.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Vertex Arboricity and Vertex Degrees

Graphs and Combinatorics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E Schmeichel
exaly   +2 more sources

Monotonicity, asymptotic normality and vertex degrees in random graphs

Bernoulli, 2007
We exploit a result by Nerman which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degrees in random graphs, where we obtain asymptotic normality for the number ...
Svante Janson
exaly   +1 more source

On ve-degrees and ev-degrees in graphs

Discrete Mathematics, 2017
Let G=(V,E) be a graph with vertex set V and edge set E. A vertex v∈V ve-dominates every edge incident to it as well as every edge adjacent to these incident edges. The vertex–edge degree of a vertex v is the number of edges ve-dominated by v. Similarly,
TERESA W Haynes, Stephen T Hedetniemi
exaly   +2 more sources

On percolation in random graphs with given vertex degrees

Electronic Journal of Probability, 2009
We study the random graph obtained by random deletionof vertices or edges from a random graph with given vertex degrees.A simple trick of exploding vertices instead of deleting them, enablesus to derive results from known results for random graphs with ...
Svante Janson
exaly   +1 more source

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion

Algorithmica, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann   +4 more
openaire   +3 more sources