Results 11 to 20 of about 178,682 (289)
Random graphs with forbidden vertex degrees [PDF]
Random Structures & Algorithms, 2010 AbstractWe study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset $ {\cal S} $ of the nonnegative integers. Subject to a certain hypothesis on $ {\cal S} $, the empirical distribution of the vertex degrees is asymptotically Poisson with some parameter $ \hat{\mu} $ given as the root of a certain ...
Grimmett, Geoffrey, Janson, Svante
openaire +5 more sources
Vertex degrees of planar graphs
Journal of Combinatorial Theory, Series B, 1979 AbstractLet G be a planar graph having n vertices with vertex degrees d1, d2,…,dn. It is shown that Σi=1ndi2 ≤ 2n2 + O(n). The main term in this upper bound is best possible.
openaire +3 more sources
Self-locking degree-4 vertex origami structures [PDF]
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2016 A generic degree-4 vertex (4-vertex) origami possesses one continuous degree-of-freedom for rigid folding, and this folding process can be stopped when two of its facets bind together. Such facet-binding will induceself-lockingso that the overall structure stays at a pre-specified configuration without additional locking elements or actuators.
Hongbin Fang, Suyi Li, K. W. Wang
openaire +3 more sources
Canonical linearized Regge Calculus: counting lattice gravitons with Pachner moves [PDF]
, 2014 We afford a systematic and comprehensive account of the canonical dynamics of 4D Regge Calculus perturbatively expanded to linear order around a flat background.
Hoehn, Philipp A.
core +1 more source
On Triangulations with High Vertex Degree [PDF]
Annals of Combinatorics, 2008 We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain value d chosen in {3, 4, 5}.
openaire +2 more sources
On second Zagreb index and coindex of some derived graphs [PDF]
Kragujevac Journal of Science, 2015 The second Zagreb index is defined as the sum of the products of the degrees of adjacent vertices. In this note, we examine the second Zagreb indices of some derived graphs and find expressions for these in terms of vertex degrees.
Bommanahal Basavanagoud +2 more
doaj +1 more source
P- and T-violating $\pi N N$ form factor [PDF]
, 2006 The form factor of the parity and time-reversal violating (PTV) pion-nucleon interaction is calculated from one-loop vertex diagrams. The degrees of freedom included in the effective lagrangian are nucleons, pions, $\eta$, $\rho$ and $\omega$ mesons.
't Hooft +25 more
core +2 more sources
Almost sure convergence of vertex degree densities in the vertex splitting model [PDF]
Stochastic Models, 2016 1 ...
Stefánsson, Sigurdur Örn +1 more
openaire +2 more sources
مجلة بغداد للعلوم, 2023 This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η ...
ARCHANA S., PREETHI KUTTIPULACKAL
doaj +1 more source
N-String Vertices in String Field Theory [PDF]
, 1993 We give the general form of the vertex corresponding to the interaction of an arbitrary number of strings. The technique employed relies on the ``comma" representation of String Field Theory where string fields and interactions are represented as ...
A. Abdurrahman +18 more
core +2 more sources