Results 71 to 80 of about 836,691 (279)
w-Hosoya polynomials for Pentagonal Chains [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2012 Properties of the width distance in graphs are given in this paper . The w-Hosoya Polynomials of straight pentagonal chains and of alternate pentagonal chains are obtained with Wiener indices of the width distance of such graphs.
Ali Ali, Shwan Abdul Ilyas
doaj +1 more source
On graphs with distance Laplacian eigenvalues of multiplicity n−4
AKCE International Journal of Graphs and Combinatorics, 2023 Let G be a connected simple graph with n vertices. The distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the diagonal matrix of vertex transmissions and [Formula: see text] is the distance ...
Saleem Khan, S. Pirzada, A. Somasundaram
doaj +1 more source
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
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic.
Fábio Protti, Uéverton S. Souza
doaj +1 more source
Hamilton cycles in almost distance-hereditary graphs [PDF]
, 2013 Let $G$ be a graph on $n\geq 3$ vertices. A graph $G$ is almost distance-hereditary if each connected induced subgraph $H$ of $G$ has the property $d_{H}(x,y)\leq d_{G}(x,y)+1$ for any pair of vertices $x,y\in V(H)$.
Chen, Bing, Ning, Bo
core
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
Convex Graph Invariant Relaxations For Graph Edit Distance [PDF]
, 2019 The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one graph to another.
Candogan, Utkan Onur +1 more
core +1 more source
Discrete Applied Mathematics, 2012 Accepted for publication in Discrete Applied Mathematics.
openaire +2 more sources
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
On Domination Number and Distance in Graphs [PDF]
, 2014 A vertex set $S$ of a graph $G$ is a \emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \emph{domination number} $\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over all dominating ...
Kang, Cong X.
core