Results 51 to 60 of about 187,084,903 (250)
Another H-super magic decompositions of the lexicographic product of graphs
Indonesian Journal of Combinatorics, 2018 Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combination between graph decomposition and graph labeling. A decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bijection
H Hendy +3 more
doaj +1 more source
Molecular Oncology, EarlyView.The proposed mechanism of action for the CDK12/13 inhibitor and cyclin K degrader, CT7439. CDK12/13 inhibition interrupts transcription elongation, leading to increased DNA damage that results in cell death. This agent is a potentially novel treatment option for patients with colorectal cancer. Created in BioRender. Cyclin‐dependent kinase (CDK) 12 and
Wylie K. Watlington +10 more
wiley +1 more source
On the Ramsey number of 4-cycle versus wheel
Indonesian Journal of Combinatorics, 2016 For any fixed graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest positive integer $n$ such that for every graph $F$ on $n$ vertices must contain $G$ or the complement of $F$ contains $H$.
Enik Noviani, Edy Tri Baskoro
doaj
1-well-covered graphs containing a clique of size n∕3
Electronic Journal of Graph Theory and ApplicationsA graph is well-covered if all of its maximal independent sets have the same size. A graph that remains well-covered upon the removal of any vertex is called a 1-well-covered graph.
Zakir Deniz
doaj +1 more source
Molecular Oncology, EarlyView.Arginine methylation can be viewed as a persistence‐prone post‐translational modification regulated by a network of PRMTs. Competitive and compensatory interactions among PRMTs can redistribute methylation across substrate pools shaped by sequence, structural, spatial, and environmental layers, reinforcing RNA‐processing, chromatin, and signaling ...
So Hyun Kwon, Ji Min Lee
wiley +1 more source
Attractors of directed graph IFSs that are not standard IFS attractors and their Hausdorff measure [PDF]
, 2012 "GCB was supported by an EPSRC Doctoral Training Grant whilst undertaking this work"For directed graph iterated function systems (IFSs) defined on R, we prove that a class of 2-vertex directed graph IFSs have attractors that cannot be the attractors of ...
Boore, Graeme, Falconer, Kenneth John
core +1 more source
Indonesian Journal of Combinatorics, 2016 Let ∆G be the maximum degree of a simple connected graph G(V,E). An injective mapping P : V → R∆G is said to be an orthogonal labeling of G if uv,uw ∈ E implying (P(v) − P(u)) · (P(w) − P(u)) = 0, where · is the usual dot product defined in Euclidean ...
Bernard Immanuel, Kiki A. Sugeng
doaj
On the relations among edge magic total, edge antimagic total, and ASD-antimagic graphs
Electronic Journal of Graph Theory and ApplicationsLet G be a simple and finite graph of order p and size q. The graph G is said to be edge magic total (EMT) if there is a bijection λ:V(G)∪E(G)→{1,2,…,p+q} such that all edge sums λ(x)+λ(xy)+λ(y), xy∈E(G), are the same.
Sigit Pancahayani +4 more
doaj +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
, 2011 The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source