Results 31 to 40 of about 285,444 (268)
Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs $G$ for which the Cartesian product $G \Box H$ is an efficient open domination graph when ...
Tadeja Kraner Šumenjak +3 more
doaj +1 more source
On the number of cycles in a graph
Mathematica Slovaca, 2018 Abstract There is a sizable literature on investigating the minimum and maximum numbers of cycles in a class of graphs. However, the answer is known only for special classes. This paper presents a result on the smallest number of cycles in Hamiltonian 3-connected cubic graphs. Further, it describes a proof technique that could improve an
openaire +2 more sources
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
The Edge Metric Dimension of the Comb Product of a Cycle and a Graph with a Dominant Vertex
Electronic Journal of Graph Theory and ApplicationsIn this paper, we determine the edge metric dimension of the comb product of a cycle graph and a simple graph containing a dominant vertex. This result generalizes previous findings on the edge metric dimension of the comb product of a cycle and a ...
Abdilla Nurul Azisah Mn +3 more
doaj +1 more source
Cycles in the burnt pancake graph [PDF]
Discrete Applied Mathematics, 2019 Added a reference, clarified some definitions, fixed some typos.
Saúl A. Blanco +2 more
openaire +3 more sources
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane
FEBS Letters, EarlyView.Loss of 14‐3‐3ζ in CHO cells confers resistance to exogenous phosphatidylserine (PS) and impairs endocytosis‐independent inward flip‐flop of fluorescent PS at the plasma membrane. RNAi‐mediated knockdown reproduces this defect, while no additive effect is seen in ATP11C‐deficient cells.
Akiko Yamaji‐Hasegawa +3 more
wiley +1 more source
On Longest Cycles in Essentially 4-Connected Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A planar 3-connected graph G is essentially 4-connected if, for any 3-separator S of G, one component of the graph obtained from G by removing S is a single vertex.
Fabrici Igor +2 more
doaj +1 more source
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
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
Discussiones Mathematicae Graph Theory, 2020 Let 𝒫 be a property of a graph. A graph G is said to be locally 𝒫, if the subgraph induced by the open neighbourhood of every vertex in G has property 𝒫. Ryjáček conjectures that every connected, locally connected graph is weakly pancyclic.
Tang Long, Vumar Elkin
doaj +1 more source