Results 1 to 10 of about 41,896 (267)
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
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
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
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
Some degree-based topological indices of caboxy-terminated dendritic macromolecule
Main Group Metal Chemistry, 2021 In the modern era of the chemical science, the chemical graph theory has contributed significantly to exploring the properties of the chemical compounds.
Rao Yongsheng +5 more
doaj +1 more source