Results 11 to 20 of about 21,321 (296)
Toughness and Vertex Degrees [PDF]
Journal of Graph Theory, 2012 AbstractWe study theorems giving sufficient conditions on the vertex degrees of a graph G to guarantee G is t‐tough. We first give a best monotone theorem when , but then show that for any integer , a best monotone theorem for requires at least nonredundant conditions, where grows superpolynomially as .
Douglas Bauer +4 more
openaire +7 more sources
On the degrees of a strongly vertex-magic graph [PDF]
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Camino Balbuena +8 more
core +4 more sources
Vertex Degrees in Planar Maps [PDF]
, 2016 We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers D. Our results rely on a classical bijection with mobiles (objects exhibiting a tree structure), combined with ...
Collet, Gwendal +2 more
openaire +3 more sources
Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions [PDF]
Theory and Applications of GraphsGiven a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1.
Michael R. Yatauro
doaj +3 more sources
Bridge and cycle degrees of vertices of graphs [PDF]
International Journal of Mathematics and Mathematical Sciences, 1984 The bridge degree bdeg v and cycle degree cdeg v of a vertex v in a graph G are, respectively, the number of bridges and number of cycle edges incident with v in G. A characterization of finite nonempty sets S of nonnegative integers is given for which S
Gary Chartrand +2 more
doaj +2 more sources
Theta expansion of first massive vertex operator in pure spinor [PDF]
Journal of High Energy Physics, 2018 We provide the covariant superspace equations that are sufficient to determine the complete θ expansion of the vertex operator of the open string massive states with (mass)2 = 1/α′ in pure spinor formalism of superstring theory.
Subhroneel Chakrabarti +2 more
doaj +2 more sources
Vertex degrees close to the average degree
Discrete Mathematics, 2023 Let $G$ be a finite, simple, and undirected graph of order $n$ and average degree $d$. Up to terms of smaller order, we characterize the minimal intervals $I$ containing $d$ that are guaranteed to contain some vertex degree. In particular, for $d_+\in \left(\sqrt{dn},n-1\right]$, we show the existence of a vertex in $G$ of degree between $d_+-\left ...
Johannes Pardey, Dieter Rautenbach
openaire +3 more sources
The complexity of degree anonymization by vertex addition [PDF]
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Bredereck +5 more
openaire +2 more sources
Estimation of vertex degrees in a sampled network [PDF]
2017 51st Asilomar Conference on Signals, Systems, and Computers, 2017 The need to produce accurate estimates of vertex degree in a large network, based on observation of a subnetwork, arises in a number of practical settings. We study a formalized version of this problem, wherein the goal is, given a randomly sampled subnetwork from a large parent network, to estimate the actual degree of the sampled nodes.
Apratim Ganguly, Eric D. Kolaczyk
openaire +2 more sources