Results 61 to 70 of about 569,825 (280)

No finite $5$-regular matchstick graph exists [PDF]

open access: yes, 2014
A graph $G=(V,E)$ is called a unit-distance graph in the plane if there is an injective embedding of $V$ in the plane such that every pair of adjacent vertices are at unit distance apart.
Kurz, Sascha
core  

An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane

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

THE ENTIRE FACE IRREGULARITY STRENGTH OF A BOOK WITH POLYGONAL PAGES

open access: yesBarekeng, 2015
A face irregular entire labeling is introduced by Baca et al. recently, as a modification of the well-known vertex irregular and edge irregular total labeling of graphs and the idea of the entire colouring of plane graph.
Meilin I. Tilukay, Venn Y. I. Ilwaru
doaj   +1 more source

pH‐mediated activation of the lysosomal arginine sensor SLC38A9

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

On the Laplacian spectral radii of Halin graphs

open access: yesJournal of Inequalities and Applications, 2017
Let T be a tree with at least four vertices, none of which has degree 2, embedded in the plane. A Halin graph is a plane graph constructed by connecting the leaves of T into a cycle. Thus the cycle C forms the outer face of the Halin graph, with the tree
Huicai Jia, Jie Xue
doaj   +1 more source

Thermodynamic limit of Nekrasov partition function for 5-brane web with O5-plane

open access: yesJournal of High Energy Physics, 2021
In this paper, we study 5d N $$ \mathcal{N} $$ = 1 Sp(N) gauge theory with N f (≤ 2N + 3) flavors based on 5-brane web diagram with O5-plane. On the one hand, we discuss Seiberg-Witten curve based on the dual graph of the 5-brane web with O5-plane.
Xiaobin Li, Futoshi Yagi
doaj   +1 more source

In vitro models of cancer‐associated fibroblast heterogeneity uncover subtype‐specific effects of CRISPR perturbations

open access: yesMolecular Oncology, EarlyView.
Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra   +10 more
wiley   +1 more source

New Results of Face Labeling for Some Plane Graphs

open access: yesIEEE Access, 2019
A labeling of a plane graph is called super d-antimagic if the vertices receive the smallest labels and the weight set of all faces in an arithematic progression with difference d, where weight of each face is the some of all labels correspond to that ...
Nabila Hameed   +4 more
doaj   +1 more source

Some Operations on Complex Fuzzy Graphs

open access: yesRatio Mathematica, 2023
In this paper we discussed about some types of complex fuzzy graphs which is the extension of fuzzy graph. As the membership value of elements of fuzzy graph is in between 0 and 1.
Azhagendran N, Mohamed Ismayil A
doaj   +1 more source

On building 4-critical plane and projective plane multiwheels from odd wheels [PDF]

open access: yes, 2012
We build unbounded classes of plane and projective plane multiwheels that are 4-critical that are received summing odd wheels as edge sums modulo two. These classes can be considered as ascending from single common graph that can be received as edge sum ...
Zeps, Dainis
core   +2 more sources

Home - About - Disclaimer - Privacy