Results 61 to 70 of about 3,368,549 (267)
Graph Abstraction and Abstract Graph Transformation [PDF]
, 2007 Many important systems like concurrent heap-manipulating programs, communication networks, or distributed algorithms are hard to verify due to their inherent dynamics and unboundedness.
Bauer, J. +3 more
core +1 more source
On a connection between the switching separability of a graph and that of its subgraphs
, 2011 A graph of order $n>3$ is called {switching separable} if its modulo-2 sum with some complete bipartite graph on the same set of vertices is divided into two mutually independent subgraphs, each having at least two vertices.
D. S. Krotov +6 more
core +1 more source
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
Edge Partitions of Optimal $2$-plane and $3$-plane Graphs
, 2018 A topological graph is a graph drawn in the plane. A topological graph is $k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the problem of partitioning the edges of a $k$-plane graph such that each partite set forms a graph with a ...
CSA Nash-Williams +12 more
core +1 more source
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
FEBS 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
JTAM (Jurnal Teori dan Aplikasi Matematika)Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik +5 more
doaj +1 more source
The Determinant of Matching Matrix in the Evaluation of Matching Polynomial
Revista de Matemática: Teoría y Aplicaciones, 2011 A characterization is given for graphs whose matching polynomial is the determinant of their matching matrices. The matching matrix is then modified and its relation with other graph polynomials is examined.
Shanaz A. Wahid
doaj +1 more source
Distributed Autoregressive Moving Average Graph Filters
, 2015 We introduce the concept of autoregressive moving average (ARMA) filters on a graph and show how they can be implemented in a distributed fashion.
Leus, Geert +2 more
core +1 more source
Geometric Biplane Graphs I: Maximal Graphs [PDF]
Graphs and Combinatorics, 2015 We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the sense that no edge can be added while staying biplane---may differ in the number of edges, and we provide an ...
Garcia Olaverri, Alfredo Martin +7 more
openaire +5 more sources
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