Results 71 to 80 of about 848,049 (294)

On Mixed Metric Dimension of Some Path Related Graphs

open access: yesIEEE Access, 2020
A vertex $k\in V_{G}$ determined two elements (vertices or edges) $\ell,m \in V_{G}\cup E_{G}$ , if $d_{G}(k,\ell)\neq d_{G}(k,m)$ . A set $R_ {\text {m}}$ of vertices in a graph $G$ is a mixed metric generator for $G$ , if two distinct elements
Hassan Raza, Ying Ji, Shaojian Qu
doaj   +1 more source

Rainbow colouring of split graphs

open access: yesDiscrete Applied Mathematics, 2017
A rainbow path in an edge coloured graph is a path in which no two edges are coloured the same. A rainbow colouring of a connected graph G is a colouring of the edges of G such that every pair of vertices in G is connected by at least one rainbow path.
L. Sunil Chandran   +2 more
openaire   +2 more sources

Malformin A1–mediated cytotoxicity in ovarian cancer cells occurs through pyroptosis and autophagy

open access: yesFEBS Open Bio, EarlyView.
This study investigated the effects of the natural compound Malformin A1 (MA1) on the cytoskeleton that regulates cell proliferation and migration. Disruption of the cytoskeleton can impair these processes and promote cancer cell death. MA1 disrupted cytoskeletal organization, induced DNA damage, inflammation, activated autophagy, and pyroptosis ...
Nada Abdullah Hassan   +11 more
wiley   +1 more source

Protocol for quantifying miRNA trafficking across the endosomal membrane

open access: yesFEBS Open Bio, EarlyView.
An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh   +2 more
wiley   +1 more source

First Hyper Zagreb Spectral Radii of Splitting and Shadow Graphs

open access: yesScientific Annals of Computer Science
The spectral radius RS of graph G is a spectral invariant derived from the eigenvalues of the associated matrix for a graph G. It is widely used in fields such as computer science, chemistry, biology, and network analysis.
Ahmad Bilal, Muhammad Mobeen Munir
doaj   +1 more source

Cutwidth of Split Graphs and Threshold Graphs

open access: yesSIAM Journal on Discrete Mathematics, 2011
We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Threshold graphs are a well-studied subclass of interval graphs and of split graphs, both of which are unrelated subclasses of chordal graphs.
Pinar Heggernes   +3 more
openaire   +3 more sources

Genetic dissection of human ABCE1 in yeast reveals separable requirements for ribosome recycling and suppression of aberrant reinitiation

open access: yesFEBS Open Bio, EarlyView.
Human ABCE1 cannot functionally replace its yeast ortholog. Yeast–human chimera analysis identified NBD1 as a major interspecies barrier. Genetic screening yielded hABCE1 revertants that rescue yeast viability but fail to suppress aberrant translation reinitiation in the 3′ UTR.
Eriko Nakata   +3 more
wiley   +1 more source

Towards a Maude tool for model checking temporal graph properties [PDF]

open access: yes, 2011
We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto   +4 more
core   +1 more source

Fluorination: A strategy to tune the interactions of molecules and nanoscale systems with biological matter

open access: yesFEBS Open Bio, EarlyView.
This minireview explores fluorination as a key strategy to optimize therapeutic molecules and nanocarriers. By incorporating different fluorinated motifs—from single atoms to linear and branched chains—drug delivery, cellular uptake, and colloidal stability can be improved and fine‐tuned.
Martina Beccalli   +2 more
wiley   +1 more source

Split-critical and uniquely split-colorable graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2010
Graphs and Algorithms The split-coloring problem is a generalized vertex coloring problem where we partition the vertices into a minimum number of split graphs. In this paper, we study some notions which are extensively studied for the usual vertex coloring and the cocoloring problem from the point of view of split-coloring, such as ...
Tínaz Ekim   +2 more
openaire   +6 more sources

Home - About - Disclaimer - Privacy