Results 81 to 90 of about 507,111 (281)
Identifying Vertex Covers in Graphs
The Electronic Journal of Combinatorics, 2012 An identifying vertex cover in a graph $G$ is a subset $T$ of vertices in $G$ that has a nonempty intersection with every edge of $G$ such that $T$ distinguishes the edges, that is, $e \cap T \ne \emptyset$ for every edge $e$ in $G$ and $e \cap T \ne f \cap T$ for every two distinct edges $e$ and $f$ in $G$.
Henning, Michael A., Yeo, Anders
openaire +2 more sources
FEBS Open Bio, EarlyView.CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point +7 more
wiley +1 more source
Bondage Numbers of C4 Bundles over a Cycle Cn
Journal of Applied Mathematics, 2013 Graph bundles generalize the notion of covering graphs and graph products. Graph bundles have been applied in computer architecture and communication networks.
Moo Young Sohn, Fu-Tao Hu, Jaeun Lee
doaj +1 more source
Distance-regular antipodai covering graphs
Journal of Combinatorial Theory, Series B, 1988 Let G be a regular graph with diameter d. G is said to be antipodal if given any distinct vertices u, v, w of G with v and w at distance d from u, then v is distance d from w. G is called distance-regular if for vertices u, v, in G of distance i apart, v is adjacent to \(c_ i\) vertices distance i-1 from u, \(a_ i\) vertices distance i from u, and \(b_
Aldred, R.E.L, Godsil, C.D
openaire +2 more sources
FEBS Open Bio, EarlyView.dUTPases are involved in balancing the appropriate nucleotide pools. We showed that dUTPase is essential for normal development in zebrafish. The different zebrafish genomes contain several single‐nucleotide variations (SNPs) of the dut gene. One of the dUTPase variants displayed drastically lower protein stability and catalytic efficiency as compared ...
Viktória Perey‐Simon +6 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
FEBS Open Bio, EarlyView.Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li +8 more
wiley +1 more source
On Covering a Graph Optimally with Induced Subgraphs
, 2006 We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number of vertices in each subgraph is minimized.
Thite, Shripad
core +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
Characteristic polynomials of some weighted graph bundles and its application to links
International Journal of Mathematics and Mathematical Sciences, 1994 In this paper, we introduce weighted graph bundles and study their characteristic polynomial. In particular, we show that the characteristic polynomial of a weighted K2(K¯2)-bundles over a weighted graph G? can be expressed as a product of characteristic
Moo Young Sohn, Jaeun Lee
doaj +1 more source