Results 51 to 60 of about 1,691,893 (274)
On the edge irregular reflexive labeling of corona product of graphs with path
AKCE International Journal of Graphs and Combinatorics, 2021 We define a total k-labeling of a graph G as a combination of an edge labeling and a vertex labeling such that if and if where The total k-labeling is called an edge irregular reflexive k-labeling of G if every two different edges has distinct edge ...
Kooi-Kuan Yoong +5 more
doaj +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
DIMENSI METRIK KETETANGGAAN LOKAL GRAF HASIL OPERASI k-COMB
Contemporary Mathematics and Applications (ConMathA), 2019 Research on the local adjacency metric dimension has not been found in all operations of the graph, one of them is comb product graph. The purpose of this research was to determine the local adjacency metric dimension of k-comb product graph and level ...
Fryda Arum Pratama +2 more
doaj +1 more source
Graph Isomorphism Completeness for Trapezoid Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2015 4 pages, 3 Postscript ...
openaire +3 more sources
, 2023 Horizontal gene transfer is an important contributor to evolution. According to Walter M.\ Fitch, two genes are xenologs if they are separated by at least one HGT. More formally, the directed Fitch graph has a set of genes is its vertices, and directed edges $(x,y)$ for all pairs of genes $x$ and $y$ for which $y$ has been horizontally transferred at ...
Marc Hellmuth +2 more
openaire +3 more sources
Average degree conditions forcing a minor [PDF]
, 2015 Mader first proved that high average degree forces a given graph as a minor. Often motivated by Hadwiger's Conjecture, much research has focused on the average degree required to force a complete graph as a minor.
Harvey, Daniel J., Wood, David R.
core
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
The Coloring Graph of Complete Graphs
The PUMP Journal of Undergraduate Research, 2019 We study the coloring graph of the family of complete graphs and we prove that Cn(Kt) is regular, transitive, and connected when n>t. Also, we study whether Cn(Kt) is distance transitive or strongly regular, and find its diameter.
openaire +2 more sources
Molecular Oncology, EarlyView.Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice +16 more
wiley +1 more source
An exact Tur\'an result for tripartite 3-graphs [PDF]
, 2015 Mantel's theorem says that among all triangle-free graphs of a given order the balanced complete bipartite graph is the unique graph of maximum size. We prove an analogue of this result for 3-graphs. Let $K_4^-=\{123,124,134\}$, $F_6=\{123,124,345,156\}$
Sanitt, Adam, Talbot, John
core +2 more sources