Results 51 to 60 of about 2,650,610 (297)

The H-Line Signed Graph of a Signed Graph [PDF]

open access: yes, 2010
For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota   +2 more
core   +1 more source

Modular irregularity strength of disjoint union of cycle-related graph [PDF]

open access: yesITM Web of Conferences
Let G = (V,E) be a graph with a vertex set V and an edge set E of G, with order n. Modular irregular labeling of a graph G is an edge k-labeling φ:E → {1, 2,…,k} such that the modular weight of all vertices is all different. The modular weight is defined
Barack Zeveliano Zidane   +1 more
doaj   +1 more source

Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation

open access: yesFEBS Letters, EarlyView.
Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz   +11 more
wiley   +1 more source

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

Forcing (G,D)-number of a Graph [PDF]

open access: yes, 2011
By a graph G=(V,E), we mean a finite, undirected connected graph without loops and multiple ...
Nagarajan, A.   +3 more
core   +1 more source

Bounds on Co-Independent Liar’s Domination in Graphs

open access: yesJournal of Mathematics, 2021
A set S⊆V of a graph G=V,E is called a co-independent liar’s dominating set of G if (i) for all v∈V, NGv∩S≥2, (ii) for every pair u,v∈V of distinct vertices, NGu∪NGv∩S≥3, and (iii) the induced subgraph of G on V−S has no edge.
K. Suriya Prabha   +3 more
doaj   +1 more source

Biophysical approaches for studying viral entry

open access: yesFEBS Letters, EarlyView.
Viruses infect all living organisms and have been responsible for major epidemics and pandemics. Their ongoing evolutionary battle with host defenses creates a constant need for improved tools to study viral behavior. Advancing methods to probe viral attachment, fusion, and genome release deepen our understanding of how infections begin and support the
Inbar Yosibash, Raya Sorkin
wiley   +1 more source

Signed Graph Equation [PDF]

open access: yes, 2009
For standard terminology and notion in graph theory we refer the reader to Harary [7]; the non-standard will be given in this paper as and when required.
Reddy, P. Siva Kota   +3 more
core   +1 more source

Multi-channel spatial-temporal traffic flow prediction based on hybrid static-dynamic graph convolution

open access: yesDianxin kexue, 2023
Aiming at the problem that the traffic flow prediction model did not consider the correlation of road context and the dynamics of spatial dependency, a multi-channel spatial-temporal traffic flow prediction based on hybrid static-dynamic graph ...
Xiongtao ZHANG   +4 more
doaj   +2 more sources

Septin 9 PB domains coordinate centrosome positioning and microtubule acetylation to control epithelial polarity

open access: yesFEBS Letters, EarlyView.
Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy