Results 1 to 10 of about 310,108 (288)
On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion [PDF]
Journal of Discrete Algorithms, 2014 In this paper, we investigate the approximability of two node deletion problems. Given a vertex weighted graph $G=(V,E)$ and a specified, or "distinguished" vertex $p \in V$, MDD(min) is the problem of finding a minimum weight vertex set $S \subseteq V ...
Devi, N Safina +2 more
core +2 more sources
Limit distributions of maximum vertex degree in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed random variables following the power-law distribution with positive parameter τ.
Irina Cheplyukova
doaj +3 more sources
Relating graph energy with vertex-degree-based energies [PDF]
Vojnotehnički Glasnik, 2020 Introduction/purpose: The paper presents numerous vertex-degree-based graph invariants considered in the literature. A matrix can be associated to each of these invariants.
Ivan Gutman
doaj +1 more source
A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs [PDF]
SIAM Journal on Discrete Mathematics, 2022 24 pages (including appendix)
Bowtell, Candida, Hyde, Joseph
openaire +2 more sources
Stability of Complement Degree Polynomial of Graphs
مجلة بغداد للعلوم, 2023 A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of ...
Safeera K, Anil Kumar V
doaj +1 more source
On single-valued co-neutrosophic graphs [PDF]
Neutrosophic Sets and Systems, 2018 In this paper, we introduce the notion of a single-valued co-neutrosophic graphs and study some methods of construction of new single-valued co-neutrosophic graphs.
R. Dhavaseelan +3 more
doaj +1 more source
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.
Ganguly, Apratim, Kolaczyk, Eric
openaire +2 more sources
A Golden Ratio Inequality for Vertex Degrees of Graphs [PDF]
The American Mathematical Monthly, 2019 Motivated by the study of the crossing number of graphs, it is shown that, for trees, the sum of the products of the degrees of the end-vertices of all edges has an upper bound in terms of the sum of all vertex degrees to the power of $ ^2$, where $ $ is the golden ratio. The exponent $ ^2$ is best possible.
Fiachra Knox, Bojan Mohar, David R. Wood
openaire +2 more sources
PREFERENTIAL ATTACHMENT WITH FITNESS DEPENDENT CHOICE
Физико-химические аспекты изучения кластеров, наноструктур и наноматериалов, 2021 We study the asymptotic behavior of the maximum degree in the preferential attachment tree model with a choice based on both the degree and fitness of a vertex.
Y.A. Malyshkin
doaj +1 more source
The topological uniqueness of the deltahedra found in the boranes BnHn2− (6≤n≤12) [PDF]
, 1990 The deltahedra observed experimentally in the borane anions BnHn2− (6≤n≤12) are the only possible n-vertex deltahedra having only degree 4 and 5 vertices.
Duijvestijn, A.J.W., King, R.B.
core +2 more sources