Results 1 to 10 of about 310,485 (285)
Almost sure convergence of vertex degree densities in the vertex-splitting model [PDF]
Stochastic Models, 2015 We study the limiting degree distribution of the vertex splitting model introduced in \cite{DDJS:2009}. This is a model of randomly growing ordered trees, where in each time step the tree is separated into two components by splitting a vertex into two ...
Stefánsson, Sigurdur Örn +1 more
core +2 more sources
On the vertex-degree based invariants of digraphs [PDF]
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
doaj +4 more sources
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
Estimating vertex-degree-based energies [PDF]
Vojnotehnički Glasnik, 2022 Introduction/purpose: In the current literature, several dozens of vertexdegree-based (VDB) graph invariants are being studied. To each such invariant, a matrix can be associated.
Ivan Gutman
doaj +1 more source
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
On vertex and edge degree-based topological indices
Vojnotehnički Glasnik, 2023 Introduction/purpose: The entire topological indices (T Ient) are a class of graph invariants depending on the degrees of vertices and edges. Some general properties of these invariants are established.
Ivan Gutman
doaj +1 more source
Rejection and symmetric difference of bipolar picture fuzzy graph
Demonstratio Mathematica, 2023 Due to the absence of a negative of three membership functions, there are drawbacks to the existing definition of a picture fuzzy graph (PFG). In that definition of bipolar picture fuzzy graph (BPFG), membership function, neutral membership function ...
Almousa Maha Mohammed, Tchier Fairouz
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
The complexity of degree anonymization by vertex addition [PDF]
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bredereck, Robert +5 more
openaire +2 more sources
AKCE International Journal of Graphs and Combinatorics, 2020 The two Zagreb indices and are vertex-degree-based graph invariants that have been introduced in the 1970s and extensively studied ever since. In the last few years, a variety of modifications of and were put forward. The present survey of these modified
Ivan Gutman +2 more
doaj +1 more source