Results 41 to 50 of about 309,095 (284)
Study on Bipolar Single-Valued Neutrosophic Graphs With Novel Application [PDF]
Neutrosophic Sets and Systems, 2020 Unipolar is less fundamental than bipolar cognition based on truth, and composure is a restraint for truth-based worlds. Bipolarity is the most powerful phenomenon that survives when truth disappeared in a black hole due to Hawking radiation or ...
M. Aslam Malik +5 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
Dynamics of heuristic optimization algorithms on random graphs
, 2002 In this paper, the dynamics of heuristic algorithms for constructing small vertex covers (or independent sets) of finite-connectivity random graphs is analysed. In every algorithmic step, a vertex is chosen with respect to its vertex degree. This vertex,
Weigt, Martin
core +1 more source
Structural biology of ferritin nanocages
FEBS Letters, EarlyView.Ferritin is a conserved iron‐storage protein that sequesters iron as a ferric mineral core within a nanocage, protecting cells from oxidative damage and maintaining iron homeostasis. This review discusses ferritin biology, structure, and function, and highlights recent cryo‐EM studies revealing mechanisms of ferritinophagy, cellular iron uptake, and ...
Eloise Mastrangelo, Flavio Di Pisa
wiley +1 more source
A Geometric Fractal Growth Model for Scale Free Networks
, 2001 We introduce a deterministic model for scale-free networks, whose degree distribution follows a power-law with the exponent $\gamma$. At each time step, each vertex generates its offsprings, whose number is proportional to the degree of that vertex with ...
A. Broder +23 more
core +1 more source
On Domination Topological Indices of Graphs
International Journal of Analysis and Applications, 2020 Topological indices and domination in graphs are the essential topics in the theory of graphs. A set of vertices D ⊆ V (G) is said to be a dominating set for G if any vertex v ∈ V − D is adjacent to some vertex u ∈ D.
A.M. Hanan Ahmed +2 more
doaj
FEBS 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
Counting Independent Sets of a Fixed Size in Graphs with Given Minimum Degree [PDF]
, 2014 Galvin showed that for all fixed δ and sufficiently large n, the n-vertex graph with minimum degree δ that admits the most independent sets is the complete bipartite graph .
Engbers, John, Galvin, David
core +1 more source
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
FEBS Letters, EarlyView.Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes +4 more
wiley +1 more source