Results 11 to 20 of about 21,234 (294)
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
ON THE DISTRIBUTION OF THE SECOND DEGREES OF CONFIGURATION GRAPHS VERTICES
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2019 The object is configuration graphs with N vertices, numbered from 1 to N, whosevertex degrees are independent identically distributed random variables.
Elena Khvorostyanskaya
doaj +1 more source
Functions on adjacent vertex degrees of trees with given degree sequence
Open Mathematics, 2014 Wang Hua
doaj +2 more sources
On subgroups product graph of finite groups [PDF]
BIO Web of ConferencesThis paper explores Subgroup Product Graphs (SPG) in cyclic groups, presenting a Vertex Degrees Formula based on the prime factorization of a positive integer n.
Abd Shakir Jawad, Shelash Hayder B.
doaj +1 more source
Note on the Reformulated Zagreb Indices of Two Classes of Graphs
Journal of Chemistry, 2020 The reformulated Zagreb indices of a graph are obtained from the original Zagreb indices by replacing vertex degrees with edge degrees, where the degree of an edge is taken as the sum of degrees of its two end vertices minus 2.
Tongkun Qu +3 more
doaj +1 more source
Degree distance and vertex-connectivity
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patrick Ali +2 more
openaire +2 more sources
On the Vertex-Degree Based Invariants of Digraphs
Discrete Mathematics Letters, 2021 Let $D=(V,A)$ be a digraphs without isolated vertices. A vertex-degree based invariant $I(D)$ related to a real function $φ$ of $D$ is defined as a summation over all arcs, $I(D) = \frac{1}{2}\sum_{uv\in A}{φ(d_u^+,d_v^-)}$, where $d_u^+$ (resp. $d_u^-$) denotes the out-degree (resp. in-degree) of a vertex $u$.
Hanyuan Deng +4 more
openaire +4 more sources
Fringe Trees for Random Trees With Given Vertex Degrees [PDF]
We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labeled trees with given vertex degrees, for
Berzunza Ojeda, Gabriel +5 more
core +2 more sources