Results 41 to 50 of about 316,679 (279)
Discrete Dynamics in Nature and Society, 2020 The modified first Zagreb connection index ZC1∗ is a graph invariant that appeared about fifty years ago within a study of molecular modeling, and after a long time, it has been revisited in two papers ((Ali and Trinajstić, 2018) and (Naji et al., 2017))
Sadia Noureen +2 more
doaj +1 more source
, 2013 We show that the graph construction used to prove that a gauge-invariant ideal of a graph C*-algebra is isomorphic to a graph C*-algebra, and also used to prove that a graded ideal of a Leavitt path algebra is isomorphic to a Leavitt path algebra, is ...
Ruiz, Efren, Tomforde, Mark
core +1 more source
Machine Learning: Science and Technology, 2023 Learning over the domain of 3D graphs has applications in a number of scientific and engineering disciplines, including molecular chemistry, high energy physics, and computer vision.
Eyal Rozenberg, Daniel Freedman
doaj +1 more source
NetLSD: Hearing the Shape of a Graph
, 2018 Comparison among graphs is ubiquitous in graph analytics. However, it is a hard task in terms of the expressiveness of the employed similarity measure and the efficiency of its computation.
Bronstein, Alex +4 more
core +1 more source
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
Omega Index of Line and Total Graphs
Journal of Mathematics, 2021 A derived graph is a graph obtained from a given graph according to some predetermined rules. Two of the most frequently used derived graphs are the line graph and the total graph.
Musa Demirci +3 more
doaj +1 more source
A notion of graph likelihood and an infinite monkey theorem
, 2013 We play with a graph-theoretic analogue of the folklore infinite monkey theorem. We define a notion of graph likelihood as the probability that a given graph is constructed by a monkey in a number of time steps equal to the number of vertices. We present
Banerji, Christopher R. S. +2 more
core +2 more sources
pH‐mediated activation of the lysosomal arginine sensor SLC38A9
FEBS Letters, EarlyView.Cells monitor nutrient levels via the lysosomal transporter SLC38A9 to activate the mechanistic target of rapamycin complex 1 (mTORC1). This study reveals that SLC38A9 function is regulated by pH. We identified histidine 544 as a critical pH sensor that undergoes conformational changes to control amino acid efflux from lysosomes; therefore, it ...
Xuelang Mu, Ampon Sae Her, Tamir Gonen
wiley +1 more source
The Ceresa class and tropical curves of hyperelliptic type
Forum of Mathematics, SigmaWe define a new algebraic invariant of a graph G called the Ceresa–Zharkov class and show that it is trivial if and only if G is of hyperelliptic type, equivalently, G does not have as a minor the complete graph on four vertices or the loop of three ...
Daniel Corey, Wanlin Li
doaj +1 more source
Metric Dimension Parameterized by Max Leaf Number
, 2015 The metric dimension of a graph is the size of the smallest set of vertices whose distances distinguish all pairs of vertices in the graph. We show that this graph invariant may be calculated by an algorithm whose running time is linear in the input ...
Eppstein, David
core +1 more source