Results 31 to 40 of about 18,692 (262)

The structure of a configuration graph with a normally distributed parameter of the power series distribution of vertex degrees

open access: yesTransactions 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 random variables identically distributed according to the power law, with a positive parameter τ .
Yury Pavlov
doaj   +1 more source

Vertex Degree Weighted Path Indices

open access: yesActa Chimica Slovenica, 2016
Vertex degree weighted path indices P(N)(a, b, ...), for example P(1)(a, b), P(2)(a, b, c), P(3)(a, b, c, d), and P(4)(a, b, c, d, e), are good topological indices for some of the physicochemical properties of octanes with |R|(max) up to 0.999. Mutually optimized combinations of them are even better, R (P(1)..P(4)) is in the worst tested case > 0.9 ...
openaire   +5 more sources

Estimation of vertex degrees in a sampled network [PDF]

open access: yes2017 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

Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions

open access: yesTheory and Applications of Graphs
Given 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   +1 more source

Some results on the palette index of graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
Given a proper edge coloring $\varphi$ of a graph $G$, we define the palette $S_{G}(v,\varphi)$ of a vertex $v \in V(G)$ as the set of all colors appearing on edges incident with $v$.
C. J. Casselgren, Petros A. Petrosyan
doaj   +1 more source

Transferrin receptor 1‐mediated iron uptake supports thermogenic activation in human cervical‐derived adipocytes

open access: yesFEBS Letters, EarlyView.
In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai   +9 more
wiley   +1 more source

Bridge and cycle degrees of vertices of graphs

open access: yesInternational 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   +1 more source

Topological indices are not necessarily invariant to graph labeling

open access: yesActa Chimica Slovenica, 2015
Each element of the Universal matrix U (vertex-degree vertex-distance weighted matrix) represents the mutual contribution of two vertices weighted for the vertex degrees and the distance between them.
Anton Perdih
doaj   +1 more source

On the Vertex-Connectivity of an Uncertain Random Graph

open access: yesIEEE Access, 2020
In many practical problems, randomness and uncertainty simultaneously appear in one complex system or network. When graph theory is applied to these problems, these complex systems or networks are usually represented by uncertain random graphs, in which ...
Hao Li, Xin Gao
doaj   +1 more source

On Omega Index and Average Degree of Graphs

open access: yesJournal of Mathematics, 2021
Average degree of a graph is defined to be a graph invariant equal to the arithmetic mean of all vertex degrees and has many applications, especially in determining the irregularity degrees of networks and social sciences.
Sadik Delen   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy